Experimental constructions of self-dual codes
From MaRDI portal
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.
Recommendations
Cites work
- A classification of self-orthogonal codes over GF(2)
- A new upper bound on the minimal distance of self-dual codes
- A note on extended quadratic residue codes over<tex>GF(9)</tex>and their ternary images (Corresp.)
- A note on extended quaternary quadratic residue codes and their binary images
- A systematic construction of self-dual codes
- Characterization of quaternary extremal codes of lengths 18 and 20
- Classification of extremal double-circulant self-dual codes of length up to \(62\)
- Construction of an extremal self-dual code of length 62
- Construction of new extremal self-dual codes
- Construction of new extremal unimodular lattices
- Duadic Codes
- Extremal binary self-dual codes
- Generalized quadratic residue codes
- scientific article; zbMATH DE number 4123822 (Why is no real title available?)
- scientific article; zbMATH DE number 1284416 (Why is no real title available?)
- scientific article; zbMATH DE number 1284417 (Why is no real title available?)
- scientific article; zbMATH DE number 1792618 (Why is no real title available?)
- scientific article; zbMATH DE number 2154101 (Why is no real title available?)
- New binary coding results by circulants
- New optimal self-dual codes over GF(7).
- New self-dual codes over GF(4) with the highest known minimum weights
- On extremal self-dual quaternary codes of lengths 18 to 28. I
- On extremal self-dual quaternary codes of lengths 18 to 28. II
- On extremal self-dual ternary codes of lengths 28 to 40
- On ternary self-dual codes of length 24
- On the classification and enumeration of self-dual codes
- On the enumeration of self-dual codes
- Optimal double circulant self-dual codes over F/sub 4/
- Orthogonal circulant matrices over finite fields, and how to find them
- Q-codes
- Quadratic double circulant codes over fields
- Self-dual and maximal self-orthogonal codes over \({\mathbb F}_{7}\)
- Self-dual codes over GF(4)
- Self-dual codes over GF(5)
- Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
- Self-dual codes over<tex>GF(7)</tex>(Corresp.)
- Symmetry codes over GF(3) and new five-designs
- Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20
- The existence of a self-dual \([70 ,35 ,12]\) code and formally self-dual codes.
- Weight enumerators of extremal singly-even [60,30,12] codes
Cited in
(36)- On quintic quasi-cyclic codes
- On self-dual codes over \(\mathbb{F}_5\)
- Binary self-dual codes with automorphisms of order 23
- On circulant self-dual codes over small fields
- Designs and self-dual codes with long shadows.
- Performance of ternary double circulant, double twistulant, and self-dual codes
- Self-dual codes and orthogonal matrices over large finite fields
- Construction of new extremal unimodular lattices
- A note on the construction and enumeration of Euclidean self-dual skew-cyclic codes
- Self-dual codes over \(\mathbb{F}_5\) and \(s\)-extremal unimodular lattices
- Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\)
- New extremal binary self-dual codes of length 64 from \(R_3\)-lifts of the extended binary Hamming code
- On extremal double circulant self-dual codes of lengths 90--96
- Self-dual R_k lifts of binary self-dual codes
- New extremal binary self-dual codes of length 58 as \(R_3\)-lifts from the shortened binary \([8,4,4]\) Hamming code
- Extremal ternary self-dual codes constructed from negacirculant matrices
- Self-dual codes with an automorphism of order 13
- Classification of extremal double circulant self-dual codes of lengths 74--88
- Computational results of duadic double circulant codes
- Cyclic codes over \(\mathbb{F}_2 +u\mathbb{F}_2 +v\mathbb{F}_2 +v^2 \mathbb{F}_2\) with respect to the homogeneous weight and their applications to DNA codes
- Constructions of optimal Hermitian self-dual codes from unitary matrices
- On Euclidean self-dual codes and isometry codes
- Construction of quasi-cyclic self-dual codes
- Self-dual codes from circulant matrices
- Construction of self-dual codes
- A special class of quasi-cyclic codes
- scientific article; zbMATH DE number 2154141 (Why is no real title available?)
- Self-dual codes from smaller lengths of self-dual codes and recursive algorithm
- Mutually disjoint 5-designs and 5-spontaneous emission error designs from extremal ternary self-dual codes
- Duality preserving Gray maps for codes over rings
- On the classification and enumeration of self-dual codes
- The weight enumerators of singly-even self-dual \([88,44,14]\) codes and new binary self-dual \([68,34,12]\) and \([88,44,14]\) codes
- On extremal and near-extremal self-dual ternary codes
- Some self-dual codes and isodual codes constructed by matrix product codes
- Don't use it twice! Solving relaxed linear equivalence problems
- On the existence of certain optimal self-dual codes with lengths between 74 and 116
This page was built for publication: Experimental constructions of self-dual codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400981)
