A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)

@article{Kasami1974AGB,
  title={A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)},
  author={T. Kasami},
  journal={IEEE Trans. Inf. Theory},
  year={1974},
  volume={20},
  pages={679}
}
  • T. Kasami
  • Published 1974
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • It is shown that there exist arbitrarily long quasi-cyclic (2k,k) binary codes that meet a bound slightly weaker than the Gilbert-Varshamov bound. This is a refinement of the result of Chen, Peterson, and Weldon [1]. 
    88 Citations
    Some Best Rate 1/p Quasi-Cyclic Codes over GF(5)
    • 4
    New One-Generator Quasi-cyclic Codes over GF(7)
    • 9
    Good self-dual quasi-cyclic codes exist
    • 51
    • PDF
    New ternary quasi-cyclic codes with better minimum distances
    • 44
    New quasi-cyclic codes over F5
    • 18
    • PDF
    On self-dual four circulant codes
    • 7
    • PDF
    Quaternary quasi-cyclic codes
    • 1
    A minimum distance bound for quasi-nD-cyclic codes
    • 2

    References

    Some Results on Quasi-Cyclic Codes
    • 127