New linear codes over \(\mathbb{F}_3\) and \(\mathbb{F}_5\) and improvements on bounds (Q5926326)
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: New linear codes over Fâ and Fâ and improvements on bounds |
scientific article; zbMATH DE number 1571009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New linear codes over \(\mathbb{F}_3\) and \(\mathbb{F}_5\) and improvements on bounds |
scientific article; zbMATH DE number 1571009 |
Statements
New linear codes over \(\mathbb{F}_3\) and \(\mathbb{F}_5\) and improvements on bounds (English)
0 references
11 June 2001
0 references
An important problem in coding theory is to construct codes with the best possible minimum distance. In this paper, a method introduced by \textit{T. A. Gulliver} and \textit{M. Harada} [ibid. 22, 89-96 (2001; Zbl 0961.94013)] is generalized to obtain new codes which improve the best known minimum distance bounds on some linear codes over GF(3) and GF(5). A generalized Gray map is presented, and nearly quasi-cyclic codes are introduced. The generator matrices and Hamming weight enumerators of the new codes are given.
0 references
quasi-cyclic codes
0 references
bounds on codes
0 references
0.958092212677002
0 references
0.8743996024131775
0 references
0.8652696013450623
0 references
