New Quasi-Cyclic Codes From Simplex Codes
From MaRDI portal
Publication:3548863
DOI10.1109/TIT.2006.890727zbMATH Open1310.94196OpenAlexW2121145816MaRDI QIDQ3548863FDOQ3548863
Authors: Eric Z. Chen 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2006.890727
Recommendations
Cited In (19)
- A minimum distance bound for quasi-\(n\)D-cyclic codes
- Binary construction of pure additive quantum codes with distance five or six
- Quantum codes and entanglement-assisted quantum codes derived from one-generator quasi-twisted codes
- Title not available (Why is that?)
- An Explicit Construction of $2$-Generator Quasi-Twisted Codes
- Six new binary quasi-cyclic codes
- Some new constructions for simplex codes
- Quasi-cyclic codes from cyclic-structured designs with good properties
- Some new binary codes with improved minimum distances
- Bijective S-boxes of different sizes obtained from quasi-cyclic codes
- New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds
- New quasi-cyclic codes from finite upper half-planes
- Title not available (Why is that?)
- A new iterative computer search algorithm for good quasi-twisted codes
- A search algorithm for linear codes: Progressive dimension growth
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
- Generating generalized necklaces and new quasi-cyclic codes
- Quasi-cyclic subcodes of cyclic codes
- Optimal binary codes and binary construction of quantum codes
This page was built for publication: New Quasi-Cyclic Codes From Simplex Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548863)
