A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
From MaRDI portal
Publication:4048931
DOI10.1109/TIT.1974.1055262zbMath0295.94025OpenAlexW2039551368MaRDI QIDQ4048931
Publication date: 1974
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1974.1055262
Related Items (54)
Quasi-Cyclic Subcodes of Cyclic Codes ⋮ Quasi-cyclic constructions of asymmetric quantum error-correcting codes ⋮ Generalized quasi-cyclic codes with arbitrary block lengths ⋮ Quasi-cyclic constructions of quantum codes ⋮ On quasi-cyclic codes over \({\mathbb{Z}_q}\) ⋮ Construction and decoding of matrix-product codes from nested codes ⋮ A generalization of multi-twisted codes over finite fields, their Galois duals and type II codes ⋮ A (105,10,47) binary quasi-cyclic code ⋮ An updated table of rate \(1/p\) binary quasi-cyclic codes ⋮ New binary quantum codes constructed from quasi-cyclic codes ⋮ Good self-dual generalized quasi-cyclic codes exist ⋮ Two new optimal ternary two-weight codes and strongly regular graphs ⋮ Unnamed Item ⋮ Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields ⋮ Algebraic theory of block codes detecting independent errors ⋮ Asymptotically good quasi-cyclic codes of fractional index ⋮ On the algebraic structure of quasi-group codes ⋮ Constructing quasi-cyclic codes from linear algebra theory ⋮ Multi-twisted additive codes over finite fields are asymptotically good ⋮ Constructions of quasi-twisted quantum codes ⋮ Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings \(\mathbb{F}_q[v_1,v_2,\dots,v_t\)] ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ A new construction of quantum codes from quasi-cyclic codes over finite fields ⋮ Hermitian self-dual 2-quasi-abelian codes ⋮ An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem ⋮ Enumeration formulae for self-dual, self-orthogonal and complementary-dual quasi-cyclic codes over finite fields ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Construction of quasi-cyclic self-dual codes over finite fields ⋮ One-generator quasi-cyclic codes and their dual codes ⋮ On Self-Dual Four Circulant Codes ⋮ On Quasi-cyclic Codes over Integer Residue Rings ⋮ A relation between quasi-cyclic codes and 2-D cyclic codes ⋮ A new iterative computer search algorithm for good quasi-twisted codes ⋮ An infinite family of Griesmer quasi-cyclic self-orthogonal codes ⋮ Quantum codes and entanglement-assisted quantum codes derived from one-generator quasi-twisted codes ⋮ Multi-twisted codes over finite fields and their dual codes ⋮ Optimal ternary quasi-cyclic codes ⋮ A minimum distance bound for quasi-\(n\)D-cyclic codes ⋮ Algebraic structure of quasicyclic codes ⋮ A note on constacyclic and quasi-cyclic codes over \({\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2\) ⋮ On self-dual negacirculant codes of index two and four ⋮ On quintic quasi-cyclic codes ⋮ Structural properties and enumeration of quasi cyclic codes ⋮ Quantum codes derived from one-generator quasi-cyclic codes with Hermitian inner product ⋮ Extended quasi-cyclic constructions of quantum codes and entanglement-assisted quantum codes ⋮ Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes ⋮ \(\mathbb{Z}_p \mathbb{Z}_p[v\)-additive cyclic codes are asymptotically good] ⋮ QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES ⋮ Self-orthogonal quasi-abelian codes are asymptotically good ⋮ Quaternary quasi-cyclic codes ⋮ Skew multi-twisted codes over finite fields and their Galois duals ⋮ Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes ⋮ On construction of quantum codes with dual-containing quasi-cyclic codes ⋮ New quasi-cyclic codes over \({\mathbb F}_{5}\)
This page was built for publication: A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)