DocumentCode
932377
Title
Superimposed concatenated codes (Corresp.)
Author
Sugiyama, Yasuo ; Kasahara, Masao ; Hirasawa, Shigeichi ; Namekawa, Toshihiko
Volume
26
Issue
6
fYear
1980
fDate
11/1/1980 12:00:00 AM
Firstpage
735
Lastpage
736
Abstract
A family of codes of length 
over GF( 
), with 
are presented which are constructed by superimposing concatenated codes on a concatenated code. The rate 
and the distance ratio 
of the new codes satisfy the relation 
for sufficiently large values of 
and 
. The new codes are superior to the comparable Bose-Chaudhuri-Hocquenghem (BCH) codes, for 
, in the sense that they contain more codewords. An asymptotically good code constructed using these new codes has a distance ratio greater than those of other asymptotically good codes known to the authors for rates smaller than 0.007.
over GF( ), with are presented which are constructed by superimposing concatenated codes on a concatenated code. The rate and the distance ratio of the new codes satisfy the relation for sufficiently large values of and . The new codes are superior to the comparable Bose-Chaudhuri-Hocquenghem (BCH) codes, for , in the sense that they contain more codewords. An asymptotically good code constructed using these new codes has a distance ratio greater than those of other asymptotically good codes known to the authors for rates smaller than 0.007.Keywords
Concatenated codes; Concatenated codes; Delay; Information theory; Polynomials; Power engineering and energy; Reed-Solomon codes; Research and development;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1980.1056267
Filename
1056267
Link To Document