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)
Related Items (82)
Upper bounds for the cardinality of s-distances codes ⋮ Partitions and fuzziness ⋮ Weight distributions of linear codes and the Gleason-Pierce theorem ⋮ \(\mathbb {Z}_{4}\)-codes and their Gray map images as orthogonal arrays ⋮ Codes with given distances ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ A direct approach to linear programming bounds for codes and tms-nets ⋮ Division of trinomials by pentanomials and orthogonal arrays ⋮ Quasi-symmetric designs and codes meeting the Grey-Rankin bound ⋮ Equidistant families of sets ⋮ Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances ⋮ On the covering radii of a class of binary primitive cyclic codes ⋮ Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\) ⋮ Unnamed Item ⋮ On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2\) codes] ⋮ A simple combinatorial treatment of constructions and threshold gaps of ramp schemes ⋮ On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ Algebraic theory of block codes detecting independent errors ⋮ Covering Radius of Matrix Codes Endowed with the Rank Metric ⋮ Avoiding right angles and certain Hamming distances ⋮ Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach ⋮ On distance distributions of orthogonal arrays ⋮ Subset sums and block designs in a finite vector space ⋮ Divisibility of polynomials over finite fields and combinatorial applications ⋮ Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators ⋮ Strongly regular graphs having strongly regular subconstituents ⋮ Weight Distribution of Translates of Linear Codes and Generalized Pless Indentities ⋮ On the weight distribution of the cosets of MDS codes ⋮ Saturating systems and the rank-metric covering radius ⋮ A tight upper bound on the number of non-zero weights of a constacyclic code ⋮ Bounds on sets with few distances ⋮ Remarks on tactical configurations in codes ⋮ Completely regular codes and completely transitive codes ⋮ On three weights in cyclic codes with two zeros. ⋮ Bounds on three- and higher-distance sets ⋮ Beyond the orthogonal array concept. ⋮ On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric ⋮ Maximum weight spectrum codes ⋮ The covering radii of a class of binary cyclic codes and some BCH codes ⋮ On the parameters of codes for the Lee and modular distance ⋮ Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays ⋮ Cosets of an extremal binary code of the dimension 48 ⋮ On covering radii and coset weight distributions of extremal binary self-dual codes of length 40 ⋮ Многочлены Кравчука и их применения в задачах криптографии и теории кодирования ⋮ Combinatorial properties of extremal doubly-even codes of length 48 ⋮ On \(r\)-partition designs in Hamming spaces ⋮ Division of tetranomials by type II pentanomials and orthogonal arrays ⋮ On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions ⋮ On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii ⋮ The covering radius of Hadamard codes in odd graphs ⋮ How many weights can a linear code have? ⋮ Permutation codes ⋮ Kravchuk polynomials and induced/reduced operators on Clifford algebras ⋮ Unrestricted codes with the Golay parameters are unique ⋮ On the covering radius problem for ternary self-dual codes ⋮ On a generalization of distance sets ⋮ Forbidden Intersections ⋮ Dual distances of completely regular codes ⋮ 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 ⋮ A note on full weight spectrum codes ⋮ Spherical codes and designs ⋮ Binary Hamming codes and Boolean designs ⋮ 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] ⋮ On equidistant constant weight 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 ⋮ Invariance of generalized wordlength patterns ⋮ Kravchuk matrices and induced operators on Clifford algebras ⋮ Orthogonal arrays, primitive trinomials, and shift-register sequences ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Tight 2-designs and perfect 1-codes in Doob graphs ⋮ Extremal self-dual \([40,20,8\) codes with covering radius 7] ⋮ Metric coset schemes revisited ⋮ On cryptographic propagation criteria for Boolean functions ⋮ On completely regular binary codes and t-designs∗ ⋮ On the covering radius of cyclic linear codes and arithmetic codes ⋮ Further lattice packings in high dimensions ⋮ Good coverings of Hamming spaces with spheres ⋮ Covering radius and dual distance ⋮ A class of codes admitting at most three nonzero dual distances ⋮ Weight distribution and dual distance
This page was built for publication: Four fundamental parameters of a code and their combinatorial significance
