Error-correcting codes over an alphabet of four elements (Q5943691): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011275112159 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3122192503 / rank | |||
Normal rank | |||
Latest revision as of 09:58, 30 July 2024
scientific article; zbMATH DE number 1652567
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
