Algebraic techniques for nonlinear codes
From MaRDI portal
Publication:594845
DOI10.1007/BF02579339zbMath0525.94011OpenAlexW2064737342MaRDI QIDQ594845
Heinz Bauer, Bernhard Ganter, Ferdinand B. Hergert
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579339
Related Items (18)
On the linearity and classification of \(\mathbb{Z}_{p^s} \)-linear generalized Hadamard codes ⋮ On the Automorphism Groups of the $$\mathbb{Z}_{2}\mathbb{Z}_{4}$$ -Linear Hadamard Codes and Their Classification ⋮ Kernels of nonlinear Hamming codes ⋮ On the constructions of \(\mathbb{Z}_p \mathbb{Z}_{p^2}\)-linear generalized Hadamard codes ⋮ Constructions of rotated lattice constellations in dimensions power of 3 ⋮ Linearity and classification of \(\mathbb{Z}_p \mathbb{Z}_{p^2} \)-linear generalized Hadamard codes ⋮ Binary extended perfect codes of length 16 and rank 14 ⋮ ℤ₂ℤ₄-additive codes as codes over rings ⋮ On one construction method for Hadamard matrices ⋮ On Rank and Kernel of ℤ4-Linear Codes ⋮ On \(\mathbb {Z}_{2^s}\)-linear Hadamard codes: kernel and partial classification ⋮ On the rank of \(\mathbb{Z}_8\)-linear Hadamard codes ⋮ Construction and classification of \(\mathbb{Z}_{2^s}\)-linear Hadamard codes ⋮ STS-graphs of perfect codes mod kernel ⋮ \(Z_2Z_4\)-linear codes: rank and kernel ⋮ Equivalences among \(\mathbb{Z}_{2^s} \)-linear Hadamard codes ⋮ Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation
Cites Work
This page was built for publication: Algebraic techniques for nonlinear codes
