Association schemes and coding theory
From MaRDI portal
Publication:4701199
DOI10.1109/18.720545zbMath0946.05086OpenAlexW2101520088WikidataQ30039866 ScholiaQ30039866MaRDI QIDQ4701199
Vladimir I. Levenshtein, Philippe Delsarte
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.720545
surveylinear programmingupper boundsassociation schemesdualitylower boundsuniversal boundsdistance distributioncodes and designspolynomial schemestranslation schemes
Applications of mathematical programming (90C90) Association schemes, strongly regular graphs (05E30)
Related Items
\(\mathbb{Z}_4\mathbb{Z}_4 [u\)-additive cyclic and constacyclic codes] ⋮ Pairs of quadratic forms over finite fields ⋮ Rank-metric codes and their duality theory ⋮ ℤ2(ℤ2 + uℤ2)-Additive cyclic codes and their duals ⋮ On ℤprℤps-additive codes ⋮ \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality ⋮ On the Automorphism Groups of the $$\mathbb{Z}_{2}\mathbb{Z}_{4}$$ -Linear Hadamard Codes and Their Classification ⋮ A characterization of \(\mathbb {Z}_{2}\mathbb {Z}_{2}[u\)-linear codes] ⋮ Hermitian rank distance codes ⋮ \(LCD\) codes from adjacency matrices of graphs ⋮ A fast Fourier transform for the Johnson graph ⋮ Designs, groups and lattices ⋮ \(\mathbb{Z}_2\mathbb{Z}_2[u^4\)-cyclic codes and their duals] ⋮ Perturbations and projections of Kalman-Bucy semigroups ⋮ Maximum distance separable codes over ℤ2 × ℤ2s ⋮ An extremum problem for polynomials and bounds for codes with given distance and diameter ⋮ Binary linear codes from vectorial Boolean functions and their weight distribution ⋮ Additive \(G\)-codes over \(\mathbb{F}_q\) and their dualities ⋮ There is exactly one \(\mathbb {Z}_2 \mathbb {Z}_4\)-cyclic 1-perfect code ⋮ \( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good ⋮ Motifs, coherent configurations and second order network generation ⋮ Bounds for sets with few distances distinct modulo a prime ideal ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes ⋮ Unnamed Item ⋮ New quantum codes from constacyclic and additive constacyclic codes ⋮ On \(\mathbb{Z}_4\mathbb{Z}_4[u^3 \)-additive constacyclic codes] ⋮ On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ ℤ₂ℤ₄-additive codes as codes over rings ⋮ On the weight distribution of the cosets of MDS codes ⋮ Asymptotically good \(\mathbb{Z}_p\mathbb{Z}_p[u/\langle u^t\rangle\)-additive cyclic codes] ⋮ On the Terwilliger algebra of the group association scheme of \(C_n \rtimes C_2\) ⋮ Association schemes arising from bent functions ⋮ Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\) ⋮ A note on the minimal binary linear code ⋮ Codes from adjacency matrices of uniform subset graphs ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ An analogue of Vosper's theorem for extension fields ⋮ Some results on \( \mathbb{Z}_p\mathbb{Z}_p[v \)-additive cyclic codes] ⋮ Symmetric bilinear forms over finite fields of even characteristic ⋮ Beyond the orthogonal array concept. ⋮ Upper energy bounds for spherical designs of relatively small cardinalities ⋮ Partitions of Frobenius rings induced by the homogeneous weight ⋮ On the minimum average distance of binary constant weight codes ⋮ On non-antipodal binary completely regular codes ⋮ Symmetric bilinear forms over finite fields with applications to coding theory ⋮ Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling ⋮ An Assmus-Mattson theorem for codes over commutative association schemes ⋮ Energy bounds for codes and designs in Hamming spaces ⋮ On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii ⋮ Nonexistence of a few binary orthogonal arrays ⋮ \(\mathbb Z_2\mathbb Z_4\)-additive formally self-dual codes ⋮ Geometry of the Welch bounds ⋮ \(Z_2Z_4\)-linear codes: rank and kernel ⋮ PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES ⋮ A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\) ⋮ Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\) ⋮ Quadratic and symmetric bilinear forms over finite fields and their association schemes ⋮ Circulant association schemes on triples ⋮ Designs in finite metric spaces: a probabilistic approach ⋮ \(\mathbb{Z}_p \mathbb{Z}_p[v\)-additive cyclic codes are asymptotically good] ⋮ Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations ⋮ Characterization of \(p\)-ary functions in terms of association schemes and its applications ⋮ Energy bounds for codes in polynomial metric spaces ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Commutative association schemes ⋮ Wei-type duality theorems for rank metric codes ⋮ A minimal design of order 11 on the 3-sphere ⋮ Z2-Triple cyclic codes and their duals ⋮ Bounds for spherical codes: The Levenshtein framework lifted ⋮ Fourier-reflexive partitions and MacWilliams identities for additive codes ⋮ On the natural representation of \(S({\Omega})\) into \(L ^{2}(\mathcal{P}({\Omega)})\) : Discrete harmonics and Fourier transform ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions ⋮ Association schemes on general measure spaces and zero-dimensional abelian groups ⋮ One weight \(\mathbb {Z}_2\mathbb {Z}_4\) additive codes
This page was built for publication: Association schemes and coding theory
