Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Rectangular Basis of a Linear Code

Johannes MaucherContact Information, Martin BossertContact Information and Vladimir SidorenkoContact Information

(5)  Department of Information Technology, University of Ulm, Albert-Einstein-Allee 43, 89081 Ulm, Germany
(6)  Institute for Information Transmission Problems, Russian Academy of Science, B.Karetnyi per.19 101447, Moscow, GSP-4, Russia
Abstract
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.

Contact Information Johannes Maucher
Email: joma@it.e-technik.uni-ulm.de

Contact Information Martin Bossert
Email: boss@it.e-technik.uni-ulm.de

Contact Information Vladimir Sidorenko
Email: sid@iitp.ru
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)