On a new code, \([2^n - 1,n,2^{n - 1}]\) (Q1003689)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a new code, [2ⁿ - 1,n,2ⁿ - 1] |
scientific article; zbMATH DE number 5523169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a new code, \([2^n - 1,n,2^{n - 1}]\) |
scientific article; zbMATH DE number 5523169 |
Statements
On a new code, \([2^n - 1,n,2^{n - 1}]\) (English)
0 references
4 March 2009
0 references
In this paper, a new binary linear \([2^n-1, n, 2^{n-1}]\) code is developed. A systematic generator matrix of the new code is designed. The error capability of this code is \(2^{n-2}-1\). It is shown that the minimum weighted codewords of this code hold \(2-(2^n-1, 2^{n-1}, 2^{n-2})\) design, and do not hold 3-design. Also, some other properties of this code are stated and proved.
0 references
linear code
0 references
t-design
0 references
sectioned code
0 references
non-uniform error correction
0 references
0.8232005834579468
0 references
0.8102668523788452
0 references
0.7938847541809082
0 references
0.7899683713912964
0 references
0.7832833528518677
0 references
