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)
94B25: Combinatorial codes
Related Items
A survey on proper codes, An application of information theory and error-correcting codes to fractional factorial experiments, A connection between coding theory and polarized partition relations, Maximal (\(n\),3)-arcs in PG(2,13), Almost MDS codes, Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\), A new upper bound on nonbinary block codes, On covering and coloring problems for rook domains, On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre, Algebraic theory of block codes detecting independent errors, At the dawn of the theory of codes, Optimal codes, n-arcs and Laguerre geometry, Alternating bilinear forms over GF(q), Bilinear forms over a finite field, with applications to coding theory, On the Ramsey problem for multicolor bipartite graphs, Perfect two-fault tolerant search with minimum adaptiveness, Slight improvements of the Singleton bound, Multidimensional stochastic matrices and error-correcting codes, Latin hypercubes and MDS codes, A survey of constructive coding theory, and a table of binary codes of highest known rate, Matrix characterization of linear codes with arbitrary Hamming weight hierarchy, Compact storage schemes for formatted files by spanning trees
