Varieties of binary linear codes

DOI10.1007/S000120050128MaRDI QIDQ5950785zbMATH OpenOpenAlexFDO

Authors Robert W. Quackenbush

Publication date 17 December 2001

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000120050128

zbMATH Keywords

binary linear codesBoolean algebracoding theorylattice of subvarietiesuniversal algebra

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Lattices of varieties (08B15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Review text

The main objective of the paper is to look at (a part of) the problem of coding from the point of view of universal algebras. To this end, the notion of a binary code conceived as an algebra is introduced. Natural properties of codes are then expressed in universal algebraic language. Varieties and some universal algebraic properties of binary codes are investigated. Details follow. A binary code is an algebra \(\langle V,+,0,{}'\rangle \), where \(\langle V,+,0\rangle \) is a vector space over a two-element field and \({}':V\rightarrow V\) satisfies \((x')'=x'\) and \(0'=0\) (\({}'\) plays the role of a correction function, \(x'\in V\) are codewords, \(x+x'\in V\) are errors). A binary code is additive provided \((x'+y')'=x'+y'\) and uniform provided \((x'+(y+y'))'=x'\). These notions are introduced in Section~1, where some of their basic properties are also shown. Section~2 is devoted to varieties of binary codes, especially to the structure of subvarieties of the variety \(\mathcal L\) of all linear binary codes. It is shown that the lattice of subvarieties of \(\mathcal L\) is isomorphic to the linear sum of the four-element Boolean algebra and an \((\omega +1)\)-chain of varieties. Then, invoking a theorem from commutator theory, it is shown that each binary linear code is nilpotent of class \(\leq 2\). Section~3 deals with some classical codes. These codes (parity-check codes, repetition codes, free codes, and Hamming codes) are reviewed from the universal algebraic perspective.

Recommendations

• scientific article; zbMATH DE number 3972932
• New binary linear codes
• A general theory of codes, II: Paradigms and homomorphisms
• Standard bases for binary linear codes
• Wajsberg algebras arising from binary block codes

Cited in

(6)

• A family of nonbinary linear codes
• Rigid linear binary codes
• Bilinear forms and linear codes
• The ideal entropy of BCI-algebras and its application in the binary linear codes
• scientific article; zbMATH DE number 3972932 (Why is no real title available?)
• scientific article; zbMATH DE number 1792627 (Why is no real title available?)

This page was built for publication: Varieties of binary linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950785)