Codes over integer residue rings
From MaRDI portal
Publication:4082675
DOI10.1016/S0019-9958(75)80001-5zbMath0319.94003MaRDI QIDQ4082675
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
linear codesHamming codecyclic codesgroup ring of cyclic groupReed-Solomon codes BCH codering of integers modulo prime power
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items (40)
Construction of binary Hadamard codes and their \(s\)-PD sets ⋮ On the linearity and classification of \(\mathbb{Z}_{p^s} \)-linear generalized Hadamard codes ⋮ Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\) ⋮ On the $$(1+u^2+u^3)$$ -Constacyclic and Cyclic Codes Over the Finite Ring $$ {F}_2+u{F}_2+u^2{F}_2+u^3{F}_2+v{F}_2 $$ ⋮ Information set decoding in the Lee metric with applications to cryptography ⋮ A class of skew-cyclic codes over \(\mathbb{Z}_4+u\mathbb{Z}_4\) with derivation ⋮ A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers ⋮ Modular and \(p\)-adic cyclic codes ⋮ Self-dual constacyclic codes of length \(2^s\) over the ring \(\mathbb{F}_{2^m}[u,v/\langle u^2, v^2, uv-vu \rangle \)] ⋮ CYCLIC CODES THROUGH B[X, $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON] ⋮ Computing the reciprocal of units in Galois rings ⋮ Construction and decoding of BCH codes over chain of commutative rings ⋮ Density of free modules over finite chain rings ⋮ A family of constacyclic codes over \(\mathbb F_{2} + u\mathbb F_{2} + v\mathbb F_{2} + uv\mathbb F_{2}\) ⋮ Cyclic codes over finite rings ⋮ On constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} [ u , v \slash \langle u^2 , v^2 , u v - v u \rangle \)] ⋮ Linear codes and cyclic codes over finite rings and their generalizations: a survey ⋮ A class of constacyclic codes over \(\mathbb F_{p}+v\mathbb F_{p}\) and its Gray image ⋮ Submodule codes as spherical codes in buildings ⋮ Convolutional codes over finite chain rings, MDP codes and their characterization ⋮ Integer codes capable of correcting burst asymmetric errors ⋮ On \(\mathbb {Z}_{2^s}\)-linear Hadamard codes: kernel and partial classification ⋮ Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ Low-rank parity-check codes over Galois rings ⋮ Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring ⋮ Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \) ⋮ The Gray images of \((1+u)\) constacyclic codes over \(\mathbb F_{2^m}[u/\langle u^k\rangle\)] ⋮ Self-dual codes over the integers modulo 4 ⋮ On generator matrices and parity check matrices of generalized integer codes ⋮ Finite Rings with Applications ⋮ Structure of linear codes over the ring \(B_k\) ⋮ Galois Rings and Pseudo-random Sequences ⋮ MDS codes over finite principal ideal rings ⋮ Construction of MDS self-dual codes over Galois rings ⋮ Cyclic codes over the integers modulo \(p^m\). ⋮ REPEATED-ROOT CONSTACYCLIC CODES OVER F3+uF3+uvF3 ⋮ On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\) ⋮ On linear codes over \(\mathbb Z_2\) ⋮ Quantum codes from constacyclic codes over a semi-local ring ⋮ NEW OPTIMAL LINEAR CODES OVER
This page was built for publication: Codes over integer residue rings
