Error-correcting codes over an alphabet of four elements (Q5943691)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1652567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Error-correcting codes over an alphabet of four elements |
scientific article; zbMATH DE number 1652567 |
Statements
Error-correcting codes over an alphabet of four elements (English)
0 references
4 November 2001
0 references
This papers presents bounds on the maximum size of a code of length \(n\) and minimum distance \(d\), denoted \(A_q(n,d)\). Combinatorial bounds are given, and it is determined when \(A_q(n,d) = M\) for \(q < M < 2q\). Numerous constructions are presented, and a table of the best known bounds on \(A_4(n,d)\) is given for \(n \leq 12\).
0 references
bounds on codes
0 references
nonlinear codes
0 references
0.873933732509613
0 references
0.8199463486671448
0 references
0.8170080780982971
0 references
0.8072758913040161
0 references
