QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES
From MaRDI portal
Publication:3087097
DOI10.1142/S1793830911001127zbMath1252.94121MaRDI QIDQ3087097
Dimitris E. Simos, Christos Koukouvinos
Publication date: 2 August 2011
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
quasi-cyclic codesoptimalitylinear codesgenetic algorithmscirculant matricessupersaturated designscomplementary-dual codeslower bounds on minimum distance of codes
Linear codes (general theory) (94B05) Combinatorial optimization (90C27) Other designs, configurations (05B30) Statistical block designs (62K10) Cyclic codes (94B15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On complementary-dual quasi-cyclic codes
- Exploring \(k\)-circulant supersaturated designs via genetic algorithms
- Optimal ternary quasi-cyclic codes
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- An updated table of rate \(1/p\) binary quasi-cyclic codes
- On the parity of permanents of circulant matrices
- Distribution of cyclic matrices in a finite field
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- On quasi-cyclic codes with rate l m (Corresp.)
- Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
- Six new binary quasi-cyclic codes
- A method for constructing supersaturated designs and its Es2 optimality
- A link between quasi-cyclic codes and convolutional codes
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- Tailbiting codes: bounds and search results
- Some new binary, quasi-cyclic codes
- Reversible codes
- Self-orthogonal quasi-cyclic codes
- Some results on quasi-cyclic codes
- Decoding of circulant codes (Corresp.)
- THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
