Some new binary codes with improved minimum distances
From MaRDI portal
Publication:5241169
Recommendations
Cites work
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- A new iterative computer search algorithm for good quasi-twisted codes
- New Quasi-Cyclic Codes From Simplex Codes
- New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds
- New good quasi-cyclic ternary and quaternary linear codes
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- New ternary quasi-cyclic codes with better minimum distances
- Nine good rate (m-1)/pm quasi-cyclic codes
- On quasi-cyclic codes with rate l m (Corresp.)
- Six new binary quasi-cyclic codes
- Some new quasi-twisted ternary linear codes
- Some results on quasi-cyclic codes
- The Magma algebra system. I: The user language
- The structure of 1-generator quasi-twisted codes and new linear codes
- Twelve good rate (m-r)/pm quasi-cyclic codes
- Two new rate 2/p binary quasi-cyclic codes
Cited in
(8)- scientific article; zbMATH DE number 702178 (Why is no real title available?)
- New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds
- Improvement on minimum distance of symbol-pair codes
- New binary linear codes from quasi-cyclic codes and an augmentation algorithm
- On construction of quantum codes with dual-containing quasi-cyclic codes
- scientific article; zbMATH DE number 1618190 (Why is no real title available?)
- Generating generalized necklaces and new quasi-cyclic codes
- Constructions of binary codes with two distances
This page was built for publication: Some new binary codes with improved minimum distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241169)
