Rectangular basis of a linear code

Johannes Maucher; Martin Bossert; Vladimir Sidorenko

doi:10.1007/3-540-46665-7_15

Rectangular basis of a linear code

Johannes Maucher, Martin Bossert, Vladimir Sidorenko

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Cryptography and Coding - 7th IMA International Conference, Proceedings
Editors	Michael Walker
Publisher	Springer Verlag
Pages	135-143
Number of pages	9
ISBN (Print)	354066887X, 9783540668879
DOIs	https://doi.org/10.1007/3-540-46665-7_15
State	Published - 1999
Externally published	Yes
Event	7th IMA International Conference on Cryptography and Coding, 1999 - Cirencester, United Kingdom Duration: 20 Dec 1999 → 22 Dec 1999

Publication series

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

Conference

Conference	7th IMA International Conference on Cryptography and Coding, 1999
Country/Territory	United Kingdom
City	Cirencester
Period	20/12/99 → 22/12/99

Access to Document

10.1007/3-540-46665-7_15

Cite this

Maucher, J., Bossert, M., & Sidorenko, V. (1999). Rectangular basis of a linear code. In M. Walker (Ed.), Cryptography and Coding - 7th IMA International Conference, Proceedings (pp. 135-143). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1746). Springer Verlag. https://doi.org/10.1007/3-540-46665-7_15

@inproceedings{1acf6aa8e6804d32b76f0af1c6a56880,

title = "Rectangular basis of a linear code",

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.",

author = "Johannes Maucher and Martin Bossert and Vladimir Sidorenko",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 7th IMA International Conference on Cryptography and Coding, 1999 ; Conference date: 20-12-1999 Through 22-12-1999",

year = "1999",

doi = "10.1007/3-540-46665-7_15",

language = "English",

isbn = "354066887X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "135--143",

editor = "Michael Walker",

booktitle = "Cryptography and Coding - 7th IMA International Conference, Proceedings",

}

Maucher, J, Bossert, M & Sidorenko, V 1999, Rectangular basis of a linear code. in M Walker (ed.), Cryptography and Coding - 7th IMA International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1746, Springer Verlag, pp. 135-143, 7th IMA International Conference on Cryptography and Coding, 1999, Cirencester, United Kingdom, 20/12/99. https://doi.org/10.1007/3-540-46665-7_15

Rectangular basis of a linear code. / Maucher, Johannes; Bossert, Martin; Sidorenko, Vladimir.
Cryptography and Coding - 7th IMA International Conference, Proceedings. ed. / Michael Walker. Springer Verlag, 1999. p. 135-143 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1746).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Rectangular basis of a linear code

AU - Maucher, Johannes

AU - Bossert, Martin

AU - Sidorenko, Vladimir

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84961307574&partnerID=8YFLogxK

U2 - 10.1007/3-540-46665-7_15

DO - 10.1007/3-540-46665-7_15

M3 - Conference contribution

AN - SCOPUS:84961307574

SN - 354066887X

SN - 9783540668879

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 135

EP - 143

BT - Cryptography and Coding - 7th IMA International Conference, Proceedings

A2 - Walker, Michael

PB - Springer Verlag

T2 - 7th IMA International Conference on Cryptography and Coding, 1999

Y2 - 20 December 1999 through 22 December 1999

ER -

Rectangular basis of a linear code

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this