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: | |
|---|---|
| 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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_masteral-11972 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_masteral-119722021-02-05T14:05:10Z On greedy codes Bumanglag, Oscar M., Jr. 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 . The parity check matrix for C is H = [g(en) g(e2)g(e1)] where for any 1 i n, ei are the standard unit basis. Also for each vector z in Fn 2 , g(z) is the syndrome of z relative to H. Triangular-greedy codes is one type of greedy code wherein it is generated from the triangular ordered basis. It contains only even weight vectors and for distance exactly equal to 2 the triangular-greedy code is the set of all even weight vectors. In this paper, I discuss the dimension of the triangular greedy-codes of length n and distance d. v 2015-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_masteral/5134 Master's Theses English Animo Repository Algorithms Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Algorithms Mathematics |
| spellingShingle |
Algorithms Mathematics Bumanglag, Oscar M., Jr. On greedy codes |
| description |
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 . The parity check matrix for C is H = [g(en) g(e2)g(e1)] where for any 1 i n, ei are the standard unit basis. Also for each vector z in Fn 2 , g(z) is the syndrome of z relative to H.
Triangular-greedy codes is one type of greedy code wherein it is generated from the triangular ordered basis. It contains only even weight vectors and for distance exactly equal to 2 the triangular-greedy code is the set of all even weight vectors. In this paper, I discuss the dimension of the triangular greedy-codes of length n and distance d. v |
| format |
text |
| author |
Bumanglag, Oscar M., Jr. |
| author_facet |
Bumanglag, Oscar M., Jr. |
| author_sort |
Bumanglag, Oscar M., Jr. |
| title |
On greedy codes |
| title_short |
On greedy codes |
| title_full |
On greedy codes |
| title_fullStr |
On greedy codes |
| title_full_unstemmed |
On greedy codes |
| title_sort |
on greedy codes |
| publisher |
Animo Repository |
| publishDate |
2015 |
| url |
https://animorepository.dlsu.edu.ph/etd_masteral/5134 |
| _version_ |
1800918837227421696 |