Maximum distance<tex>q</tex>-nary codes
From MaRDI portal
Publication:5737520
DOI10.1109/TIT.1964.1053661zbMath0124.11505WikidataQ56883086 ScholiaQ56883086MaRDI QIDQ5737520
Publication date: 1964
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Multidimensional stochastic matrices and error-correcting codes, A characterization of MDS codes that have an error correcting pair, An equivalence based classification of [6, 3, 4 error correcting codes over GF(5)], Slight improvements of the Singleton bound, On ℤprℤps-additive codes, Classification of MDS Codes over Small Alphabets, Classical codes in quantum state space, GRAPHICAL QUANTUM ERROR-CORRECTING CODES BASED ON ENTANGLEMENT OF SUBGRAPHS, On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre, Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices, Maximum distance separable codes over ℤ2 × ℤ2s, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, Algebraic theory of block codes detecting independent errors, The covering problem in Rosenbloom-Tsfasman spaces, A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices, Counting generalized Reed-Solomon codes, New classes of NMDS codes with dimension 3, Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings, Linear tree codes and the problem of explicit constructions, Some matroids related to sum-rank metric codes, Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius, The Relation Between CENC and NEMO, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\), Some new classes of additive MDS and almost MDS codes over finite fields, Private Information Retrieval from Coded Databases with Colluding Servers, Strong forms of orthogonality for sets of hypercubes, Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\), Strong security of linear ramp secret sharing schemes with general access structures, Optimal quantum error correcting codes from absolutely maximally entangled states, Some results on \( \mathbb{Z}_p\mathbb{Z}_p[v \)-additive cyclic codes], Invariant sets under linear operator and covering codes over modules, Construction of high rate \(\mathcal {T}\)-direct codes, A new upper bound on nonbinary block codes, Sets of orthogonal hypercubes of class \(r\), Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \), Almost MDS codes, Known-Key Distinguishers on 11-Round Feistel and Collision Attacks on Its Hashing Modes, A survey on proper codes, Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\), Roos bound for skew cyclic codes in Hamming and rank metric, GRAPHICAL QUANTUM LOW-DENSITY PARITY-CHECK CODES, The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\), A \(p\)-adic condition on the weight of a codeword of a linear code, An application of information theory and error-correcting codes to fractional factorial experiments, The Secret Life of Keys: On the Calculation of Mechanical Lock Systems, At the dawn of the theory of codes, A connection between coding theory and polarized partition relations, Classification of Graeco-Latin Cubes, Compact storage schemes for formatted files by spanning trees, Maximal (\(n\),3)-arcs in PG(2,13), Latin hypercubes and MDS codes, Optimal codes, n-arcs and Laguerre geometry, Alternating bilinear forms over GF(q), Singleton's Bound in Euclidean Codes, A coding scheme that increases the code rate, Computing AES related-key differential characteristics with constraint programming, On proper secrets, \((t,k)\)-bases and linear codes, Bilinear forms over a finite field, with applications to coding theory, Elliptic near-MDS codes over \(\mathbb{F}_5\), MDS and \(I\)-perfect poset block codes, Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices, On the Ramsey problem for multicolor bipartite graphs, A geometric characterization of minimal codes and their asymptotic performance, A survey of constructive coding theory, and a table of binary codes of highest known rate, Two-weight codes: upper bounds and new optimal constructions, Theory of supports for linear codes endowed with the sum-rank metric, Perfect two-fault tolerant search with minimum adaptiveness, A new piggybacking design for systematic MDS storage codes, Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture, Matrix characterization of linear codes with arbitrary Hamming weight hierarchy, Feynman graphs and the large dimensional limit of multipartite entanglement, Non-malleability against polynomial tampering, Codes for Distributed Storage, Hypercube Packings and Coverings with Higher Dimensional Rooks, On covering and coloring problems for rook domains
