Ordered Binary Decision Diagrams and Minimal Trellises
IEEE Transactions on Computers
A Distance Measure Tailored to Tailbiting Codes
Problems of Information Transmission
Codes on Graphs: A Survey for Algebraists
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Many Faces of Block Codes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Package for the Implementation of Block Codes as Finite Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
On viewing block codes as finite automata
Theoretical Computer Science
Constraint complexity of realizations of linear codes on arbitrary graphs
IEEE Transactions on Information Theory
Automatic classification system of Wushu video based on SVM
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
Matrix Coded Modulation: A New Non-coherent MIMO Scheme
Wireless Personal Communications: An International Journal
| Hi-index | 754.90 |
Tail-biting trellis representations of block codes are investigated. We develop some elementary theory, and present several intriguing examples, which we hope will stimulate further developments in this field. In particular, we construct a 16-state 12-section structurally invariant tail-biting trellis for the (24, 12, 8) binary Golay code. This tail-biting trellis representation is minimal: it simultaneously minimizes all conceivable measures of state complexity. Moreover, it compares favorably with the minimal conventional 12-section trellis for the Golay code, which has 256 states at its midpoint, or with the best quasi-cyclic representation of this code, which leads to a 64-state tail-biting trellis. Unwrapping this tail-biting trellis produces a periodically time-varying 16-state rate-1/2 “convolutional Golay code” with d=8, which has attractive performance/complexity properties. We furthermore show that the (6, 3, 4) quaternary hexacode has a minimal 8-state group tail-biting trellis, even though it has no such linear trellis over F4. Minimal tail-biting trellises are also constructed for the (8, 4, 4) binary Hamming code, the (4, 2, 3) ternary tetracode, the (4, 2, 3) code over F4, and the Z4-linear (8. 4, 4) octacode