On quasi-cyclic codes with rate l m (Corresp.)
From MaRDI portal
(Redirected from Publication:4158946)
Recommendations
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- Equivalent rate 1/2 quasi-cyclic codes (Corresp.)
- Some results on quasi-cyclic codes
- On quasi-cyclic codes as a generalization of cyclic codes
- scientific article; zbMATH DE number 7180100
- A note on quasi-cyclic codes
- An updated table of rate 1/p binary quasi-cyclic codes
- On the Encoding Complexity of Quasi-Cyclic LDPC Codes
- New good rate (m-1)/pm ternary and quaternary quasi-cyclic codes
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
Cited in
(16)- An updated table of rate 1/p binary quasi-cyclic codes
- Nine good rate (m-1)/pm quasi-cyclic codes
- Quasi-cyclic codes from cyclic-structured designs with good properties
- Rate one-third non-malleable codes
- On quasi-cyclic codes over \({\mathbb{Z}_q}\)
- Some new binary codes with improved minimum distances
- New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
- New good quasi-cyclic codes and codes with improved minimum distance
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- Some results on quasi-cyclic codes
- A new iterative computer search algorithm for good quasi-twisted codes
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
- Optimal ternary quasi-cyclic codes
- The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
- Algebraic structure of quasicyclic codes
- An improvement of the Griesmer bound for some small minimum distances
This page was built for publication: On quasi-cyclic codes with rate l m (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158946)
