Four fundamental parameters of a code and their combinatorial significance
From MaRDI portal
Publication:5183380
DOI10.1016/S0019-9958(73)80007-5zbMath0274.94010MaRDI QIDQ5183380
Publication date: 1973
Published in: Information and Control (Search for Journal in Brave)
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
On the covering radius problem for ternary self-dual codes, Weight distribution of translates of MDS codes, The weight distribution of the coset leaders for some classes of codes with related parity-check matrices, Covering radius and dual distance, A class of codes admitting at most three nonzero dual distances, Completely regular codes and completely transitive codes, On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes], Invariance of generalized wordlength patterns, On the covering radius of cyclic linear codes and arithmetic codes, Good coverings of Hamming spaces with spheres, Upper bounds for the cardinality of s-distances codes, Partitions and fuzziness, Codes with given distances, Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances, Algebraic theory of block codes detecting independent errors, Strongly regular graphs having strongly regular subconstituents, Remarks on tactical configurations in codes, On the parameters of codes for the Lee and modular distance, Cosets of an extremal binary code of the dimension 48, Combinatorial properties of extremal doubly-even codes of length 48, On \(r\)-partition designs in Hamming spaces, The covering radius of Hadamard codes in odd graphs, Unrestricted codes with the Golay parameters are unique, Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\), Codes projectifs à deux poids, caps complets et ensembles de différences, Spherical codes and designs, Orthogonal arrays, primitive trinomials, and shift-register sequences, Metric coset schemes revisited, Weight distribution and dual distance, Weight distributions of linear codes and the Gleason-Pierce theorem, Quasi-symmetric designs and codes meeting the Grey-Rankin bound, On the covering radius of an unrestricted code as a function of the rate and dual distance, On three weights in cyclic codes with two zeros., Beyond the orthogonal array concept., Tight 2-designs and perfect 1-codes in Doob graphs, On equidistant constant weight codes, Extremal self-dual \([40,20,8\) codes with covering radius 7], On cryptographic propagation criteria for Boolean functions, Equidistant families of sets, On covering radii and coset weight distributions of extremal binary self-dual codes of length 40, Dual distances of completely regular codes, A direct approach to linear programming bounds for codes and tms-nets, Division of trinomials by pentanomials and orthogonal arrays, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Unnamed Item, On completely regular binary codes and t-designs∗, Weight Distribution of Translates of Linear Codes and Generalized Pless Indentities, Forbidden Intersections, Further lattice packings in high dimensions
