Asymptotically Good Codes Obtained by an Extended Primitive BCH Code Concatenated with Interleaved Codes

2019 
How to construct asymptotically good codes is one of the hottest topic in modern coding theory. In this paper, we concatenated an extended primitive BCH outer code with a class of binary inner codes constructed by an interleaved code to get a class of asymptotically good codes. It is shown that Weldon [1] is its special case.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    7
    References
    2
    Citations
    NaN
    KQI
    []