Experimental constructions of self-dual codes (Q1400981): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s1071-5797(03)00011-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060023177 / rank | |||
Normal rank |
Latest revision as of 09:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Experimental constructions of self-dual codes |
scientific article |
Statements
Experimental constructions of self-dual codes (English)
0 references
17 August 2003
0 references
The authors propose a new experimental method to construct quickly and easily ``good'' self-dual codes of any length over any alphabet. The term ``good'' is appointed to the minimum distance of the code which is exactly or approximately very close to the highest known minimum distance for the self-dual code of a particular length. The method given generalizes the binary code construction proposed to any alphabet and mainly relies on computation. An extended list of self-dual codes constructed by this method is given, which seems to indicate that the codes are ``good'' indeed. These codes are constructed to phase the burst error correction. The notion and the analysis of these codes are also given in the paper. The given general experimental method is a generalization of the codes of \textit{J. Carlach} and \textit{C. Vervoux} [A new family of block-turbo codes, Proc. AAECC13, Hawaii, 15-16 (1999)]. Some special cases of these codes are also considered.
0 references
0 references