DocumentCode
911538
Title
Punctured uniform codes
Author
Robinson, John P.
Volume
15
Issue
1
fYear
1969
fDate
1/1/1969 12:00:00 AM
Firstpage
149
Lastpage
152
Abstract
The structure of a uniform convolutional code, i.e., a code whose average distance is equal to its minimum distance, is examined, and results in a parity equation lattice. From this lattice, punctured uniform codes, i.e., uniform codes with parity bits deleted, are constructed, which can be threshold decoded and have limited error propagation. An "optimum" deletion sequence is provided. Some of the punctured uniform codes are optimal from a minimum-distance view point.
Keywords
Convolutional codes; Cities and towns; Convolutional codes; Decoding; Equations; Error correction codes; Feedback; Lattices; Parity check codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1969.1054236
Filename
1054236
Link To Document