On quasi-cyclic codes with rate l m (Corresp.)
From MaRDI portal
Publication:4158946
DOI10.1109/TIT.1978.1055929zbMath0379.94019OpenAlexW2162118597MaRDI QIDQ4158946
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1978.1055929
Related Items
An improvement of the Griesmer bound for some small minimum distances ⋮ New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds ⋮ A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm ⋮ On quasi-cyclic codes over \({\mathbb{Z}_q}\) ⋮ An updated table of rate \(1/p\) binary quasi-cyclic codes ⋮ Unnamed Item ⋮ The smallest length of binary 7-dimensional linear codes with prescribed minimum distance ⋮ Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory ⋮ A new iterative computer search algorithm for good quasi-twisted codes ⋮ Optimal ternary quasi-cyclic codes ⋮ Algebraic structure of quasicyclic codes ⋮ QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES