© The Institution of Electrical Engineers
Some new optimal binary partial unit memory codes are presented. The codes are constructed from extended BCH codes. A general method for constructing PUM codes based on extended RS and BCH codes is described.
References
-
-
1)
-
J. Justesen ,
E. Paaske ,
M. Ballan
.
Quasi-cyclic unit memory convolutional codes.
IEEE Trans.
,
540 -
547
-
2)
-
U. Dettmar ,
S.A. Shavgulidze
.
New optimal partial unit memory codes.
Electron. Lett.
,
1748 -
1749
-
3)
-
G. Lauer
.
Some optimal partial-unit-memory codes.
IEEE Trans.
,
240 -
243
-
4)
-
R.E. Blahut
.
(1983)
, Theory and practive of error control codes.
-
5)
-
V. Zyablov ,
S. Shavgulidze
.
(1991)
, Generalized concatenated constructions on the base of convolution codes.
-
6)
-
L. Lee
.
Short unit-memory byte-oriented binary convolutional codes having maximal free distance.
IEEE Trans.
,
349 -
352
-
7)
-
Justesen, J.: `Bounded distance decoding of unit memory codes', Report IT-121, Institute of Circuit Theory and Telecommunication, ISSN 0105-8541, 1990.
-
8)
-
U. Dettmar ,
U. Sorger
.
Bounded minimum distance decoding for unit memory codes.
IEEE Trans. Inform. Theory
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19931351
Related content
content/journals/10.1049/el_19931351
pub_keyword,iet_inspecKeyword,pub_concept
6
6