A method for constructing self-dual codes over \(\mathbb {Z}_{2^m}\)
From MaRDI portal
Publication:2340175
DOI10.1007/s10623-013-9907-3zbMath1331.94066OpenAlexW1993356595MaRDI QIDQ2340175
Publication date: 16 April 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9907-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Other types of codes (94B60)
Related Items (2)
Unnamed Item ⋮ Self-orthogonal codes over \(\mathbb{Z}_4\) arising from the chain ring \(\mathbb{Z}_4 [u / \langle u^2 + 1 \rangle \)]
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Constructions of self-dual codes over finite commutative chain rings
- Self-dual codes over commutative Frobenius rings
- On circulant self-dual codes over small fields
- Construction of MDS self-dual codes over Galois rings
- On the enumeration of self-dual codes
- The existence of a self-dual \([70 ,35 ,12\) code and formally self-dual codes.]
- Type II self-dual codes over finite rings and even unimodular lattices
- The Magma algebra system. I: The user language
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- Constructing self-dual codes over \(\mathbb{F}_q[u/(u^t)\)]
- Self-dual codes over \(\mathbb{Z}_8\) and \(\mathbb{Z}_9\)
- Construction of self-dual codes over finite rings \(\mathbb Z_{p^m}\)
- CONSTRUCTION OF SELF-DUAL CODES OVER F2+ uF2
- Duality for modules over finite rings and applications to coding theory
- Fundamentals of Error-Correcting Codes
- On the Hamming distance of linear codes over a finite chain ring
- New extremal self-dual codes of lengths 36, 38, and 58
- On the classification and enumeration of self-dual codes
This page was built for publication: A method for constructing self-dual codes over \(\mathbb {Z}_{2^m}\)