On generalized concatenated constructions of perfect binary nonlinear codes (Q5930870): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:40, 5 March 2024
scientific article; zbMATH DE number 1592156
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On generalized concatenated constructions of perfect binary nonlinear codes |
scientific article; zbMATH DE number 1592156 |
Statements
On generalized concatenated constructions of perfect binary nonlinear codes (English)
0 references
2 February 2003
0 references
The paper describes five methods to construct binary perfect codes with minimum distance \(d=4\). These methods are derived from the construction of generalized concatenated codes, with appropriately chosen codes. For each method, a lower bound is given that provides the number of different binary perfect codes obtained by the method.
0 references
algebraic coding
0 references
binary perfect codes
0 references
concatenated codes
0 references
lower bound
0 references
