Abstract
A construction of cyclic codes in which an "inner" cyclic code is concatenated with appropriately chosen "outer" cyclic codes is presented. An example of the construction that improves on BCH codes of low rate is provided. Conversely, any cyclic code of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n_1 n_2</tex> can be constructed by this construction, where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n_1</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n_2</tex> are relatively prime.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
