Lexicographic code: Difference between revisions

Revision as of 15:03, 6 March 2022

Latest revision as of 23:16, 11 January 2024

(3 intermediate revisions by 2 users not shown)

Line 21:

| title = Lexicographic codes: error-correcting codes from game theory

| volume = 32

| year = 1986| citeseerx = 10.1.1.392.795
}}</ref> The binary lexicographic codes are [[linear code]]s, and include the [[Hamming code]]s and the [[binary Golay code]]s.<ref name=conslo/>

== Construction ==

Line 55 ⟶ 56:

|

|}

Here is a table of all n-bit lexicode by d-bit minimal hamming distance, resulting of maximum 2^m codewords dictionnary.

Line 777:

All odd d-bit lexicode distances are exact copies of the even d+1 bit distances minus the last dimension, so

an odd-dimensional space can never create something new or more interesting than the d+1 even-dimensional space above.

Since lexicodes are linear, they can also be constructed by means of their [[Basis (linear algebra) | basis]].<ref>{{citation

Line 810 ⟶ 809:

{ // Scan all previous

for (k=j-1; k >= 0; k--) // lexicodes.

if (pc(z[k]^i) < D) // Reverse chekingchecking

break; // is way faster...