Rectangular Basis of a Linear Code
A rectangular code is a code for which there exists an unique minimal trellis. Such a code can be considered to be an algebraically closed set under the rectangular complement operation. The notions of rectangular closure and basis were already defined. In this paper we represent a method to construct a rectangular basis of a linear code from a given linear basis.
Unable to display preview. Download preview PDF.
- 4.J. Maucher. On the theory of rectangular codes. Ph.D Thesis,Department of Information Technology, University of Ulm, 1999.Google Scholar
- 7.V. Sidorenko, J. Maucher, and M. Bossert. Rectangular codes and rectangular algebra. Proc. of 13.th AAECC Symposium, LNCS, Nov. 1999.Google Scholar
- 8.V. Sidorenko, J. Maucher, and M. Bossert. On the theory of rectangular codes. Proc. of 6.th International Workshop on Algebraic and Combinatorial Coding Theory, Sept. 1998.Google Scholar
- 9.V. Sidorenko, J. Maucher, M. Bossert, and R. Lucas. Rectangular codes in iterative decoding. Proc. of ITG Fachtagung, Jan. 2000.Google Scholar