|
|
|
|
Lexicographic code
|
| |
|
| |
Lexicographic codes or lexicodes are greedily generated error-correcting codes with remarkably good properties. They were produced independently by
Levenshtein and Conway and Sloane and are known to be linear over some finite fields.
xicode of minimum distance d and length over a finite field is generated by starting with the all zero vector and iteratively adding the next vector (in lexicographic order) of minimum Hamming distance from the vectors added so far.

Discussion
Ask a question about 'Lexicographic code'
Start a new discussion about 'Lexicographic code'
Answer questions from other users
|
Encyclopedia
Lexicographic codes or lexicodes are greedily generated error-correcting codes with remarkably good properties. They were produced independently by
Levenshtein and Conway and Sloane and are known to be linear over some finite fields.
Construction
A lexicode of minimum distance d and length over a finite field is generated by starting with the all zero vector and iteratively adding the next vector (in lexicographic order) of minimum Hamming distance from the vectors added so far. As an example, the length lexicode of minimum distance
would consist of the vectors marked by an "X" in the following example:
| Vector | In code? |
|---|
| 000 | X | | 001 | | | 010 | | | 011 | X | | 100 | | | 101 | X | | 110 | X | | 111 | |
Since lexicodes are linear, they can also be constructed by means of their basis.
External links
|
| |
|
|