Bases of rectangular codes

Vladimir Sidorenko; Johannes Maucher; Martin Bossert

doi:10.1109/ISIT.2000.866320

Bases of rectangular codes

Vladimir Sidorenko
, Johannes Maucher
, Martin Bossert

Institute for Information Transmission Problems of the Russian Academy of Sciences
Ascom Systec AG
University of Ulm

Research output: Contribution to journal › Article › peer-review

Abstract

We investigate general properties of rectangular codes. The class of rectangular codes includes all linear, group, and many non-group codes. We define a basis of a rectangular code. This basis gives a universal description of a rectangular code. The rectangular algebra is defined. We show that all bases of a length-2 rectangular code have the same cardinality. Bounds on cardinality of a basis of a rectangular code are given. We present a simple procedure to get rectangular basis of a linear code from its generator matrix.

Original language	English
Pages (from-to)	30
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/ISIT.2000.866320
State	Published - 2000
Externally published	Yes

Access to Document

10.1109/ISIT.2000.866320

Cite this

@article{f551875fbfd74cb1b1059965f678fd47,

title = "Bases of rectangular codes",

abstract = "We investigate general properties of rectangular codes. The class of rectangular codes includes all linear, group, and many non-group codes. We define a basis of a rectangular code. This basis gives a universal description of a rectangular code. The rectangular algebra is defined. We show that all bases of a length-2 rectangular code have the same cardinality. Bounds on cardinality of a basis of a rectangular code are given. We present a simple procedure to get rectangular basis of a linear code from its generator matrix.",

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

year = "2000",

doi = "10.1109/ISIT.2000.866320",

language = "English",

pages = "30",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Bases of rectangular codes

AU - Sidorenko, Vladimir

AU - Maucher, Johannes

AU - Bossert, Martin

PY - 2000

Y1 - 2000

N2 - We investigate general properties of rectangular codes. The class of rectangular codes includes all linear, group, and many non-group codes. We define a basis of a rectangular code. This basis gives a universal description of a rectangular code. The rectangular algebra is defined. We show that all bases of a length-2 rectangular code have the same cardinality. Bounds on cardinality of a basis of a rectangular code are given. We present a simple procedure to get rectangular basis of a linear code from its generator matrix.

AB - We investigate general properties of rectangular codes. The class of rectangular codes includes all linear, group, and many non-group codes. We define a basis of a rectangular code. This basis gives a universal description of a rectangular code. The rectangular algebra is defined. We show that all bases of a length-2 rectangular code have the same cardinality. Bounds on cardinality of a basis of a rectangular code are given. We present a simple procedure to get rectangular basis of a linear code from its generator matrix.

UR - https://www.scopus.com/pages/publications/0034449777

U2 - 10.1109/ISIT.2000.866320

DO - 10.1109/ISIT.2000.866320

M3 - Article

AN - SCOPUS:0034449777

SN - 2157-8095

SP - 30

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

ER -

Bases of rectangular codes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this