• DocumentCode
    32932
  • Title

    Thresholds of Random Quasi-Abelian Codes

  • Author

    Yun Fan ; Liren Lin

  • Author_Institution
    Sch. of Math. & Stat., Central China Normal Univ., Wuhan, China
  • Volume
    61
  • Issue
    1
  • fYear
    2015
  • fDate
    Jan. 2015
  • Firstpage
    82
  • Lastpage
    90
  • Abstract
    For a q-ary random quasi-Abelian code with fixed coindex and constant rate r, it is shown that the Gilbert-Varshamov (GV)-bound is a threshold point: if r is less than the GV-bound at δ ∈ (0, 1 - q-1), then the probability of the relative distance of the random code being greater than δ approaches 1 as the index goes to infinity; whereas, if r is bigger than the GV-bound at δ, then the probability approaches 0. As a corollary, there exist numerous asymptotically good quasi-Abelian codes attaining the GV-bound.
  • Keywords
    cyclic codes; probability; random codes; GV-bound; Gilbert-Varshamov bound; coindex rate; distance probability; q-ary random quasiabelian code threshold; Algebra; Hamming weight; Indexes; Linear codes; Manganese; Random variables; GV-bound; GVbound; Random quasi-abelian code; balanced code; cumulative weight enumerator; threshold;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2368138
  • Filename
    6949686