Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
Open Access
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (7) , 2562-2571
- https://doi.org/10.1109/18.796408
Abstract
The results of an extensive search for short and moderate length polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R=1/4, 1/3, 1/2, and 2/3 are reported. The tail-biting representations found are typically as good as the best known block codesKeywords
This publication has 13 references indexed in Scilit:
- Distances and distance bounds for convolutional codes—an overviewPublished by Springer Nature ,2006
- Skewness and pseudocodewords in iterative decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimal tail-biting trellises: the Golay code and moreIEEE Transactions on Information Theory, 1999
- Fundamentals of Convolutional CodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Tailbiting MAP decodersIEEE Journal on Selected Areas in Communications, 1998
- A table of state complexity bounds for binary linear codesIEEE Transactions on Information Theory, 1996
- Lower bounds on trellis complexity of block codesIEEE Transactions on Information Theory, 1995
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1993
- Decision depths of convolutional codesIEEE Transactions on Information Theory, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988