[Jump to code hierarchy]

Additive \(q\)-ary code

Description

A \(q\)-ary code whose codewords are closed under addition, i.e., for any codewords \(x,y\), \(x+y\) is also a codeword.

Cousin

  • Galois-qudit stabilizer code— Galois-qudit stabilizer codes are the closest quantum analogues of additive codes over \(GF(q)\) because addition in the field corresponds to multiplication of stabilizers in the quantum case.

Member of code lists

Primary Hierarchy

Classical Domain
Galois-field Kingdom
\(q\)-ary codeECC
Parents
\(q\)-ary code
Linear code over \(G\)ECC
Additive \(q\)-ary codes are linear over \(G=GF(q)\) since Galois fields are Abelian groups under addition.
Additive \(q\)-ary code
Children
Twisted BCH code
Dual additive codeSelf-dual additive Self-dual linear
Linear \(q\)-ary codeGray Evaluation MDS GRS Self-dual linear GRM QR Projective geometry Tanner \(q\)-ary LDPC Divisible
For \(q>2\), additive codes need not be linear since linearity also requires closure under multiplication.
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: q-ary_additive

Cite as:
“Additive \(q\)-ary code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/q-ary_additive
BibTeX:
@incollection{eczoo_q-ary_additive, title={Additive \(q\)-ary code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/q-ary_additive} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/q-ary_additive

Cite as:

“Additive \(q\)-ary code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/q-ary_additive

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/q-ary_digits/additive/q-ary_additive.yml.