Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
The trellis structure of maximal fixed-cost codes
IEEE Transactions on Information Theory - Part 1
Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
IEEE Transactions on Information Theory - Part 1
On the rectangularity of nonlinear block codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We investigate general properties of rectangular codes. The class of rectangular codes includes all linear, group, and many nongroup codes. We define a basis of a rectangular code. This basis gives a universal description of a rectangular code. In this paper the rectangular algebra is defined. We show that all bases of a t-rectangular code have the same cardinality. Bounds on the cardinality of a basis of a rectangular code are given.