On greedy codes
One of the special type of Lexicographic code is called the Greedy code (C) wherein all possible vectors in the eld Fn 2 where taken, starting from the zero vector up to the last vector in Fn 2 . This greedy codes are linear with dimension n {u100000} m where m is the index of the B-order of Fn 2 ....
Saved in:
Main Author: | Bumanglag, Oscar M., Jr. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2015
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/5134 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On greedy algorithms for binary de Bruijn sequences
by: Chang, Zuling, et al.
Published: (2021) -
Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
by: Areerat Trongratsameethong, et al.
Published: (2012) -
Converting pseudocode into Python functions (greedy techniques)
by: Liew, Evangeline
Published: (2024) -
A Greedy Double Swap Heuristic for Nurse Scheduling
by: CHOY, Junyu, et al.
Published: (2012) -
Hulls of cyclic and negacyclic codes over finite fields
by: Sangwisut, Ekkasit, et al.
Published: (2015)