Rectangular basis of a linear code

Johannes Maucher, Martin Bossert, Vladimir Sidorenko

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationCryptography and Coding - 7th IMA International Conference, Proceedings
EditorsMichael Walker
PublisherSpringer Verlag
Pages135-143
Number of pages9
ISBN (Print)354066887X, 9783540668879
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event7th IMA International Conference on Cryptography and Coding, 1999 - Cirencester, United Kingdom
Duration: 20 Dec 199922 Dec 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1746
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th IMA International Conference on Cryptography and Coding, 1999
Country/TerritoryUnited Kingdom
CityCirencester
Period20/12/9922/12/99

Fingerprint

Dive into the research topics of 'Rectangular basis of a linear code'. Together they form a unique fingerprint.

Cite this