Pages that link to "Item:Q5183380"
From MaRDI portal
The following pages link to Four fundamental parameters of a code and their combinatorial significance (Q5183380):
Displayed 50 items.
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (Q380446) (← links)
- Divisibility of polynomials over finite fields and combinatorial applications (Q411500) (← links)
- Division of tetranomials by type II pentanomials and orthogonal arrays (Q505857) (← links)
- On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii (Q513495) (← links)
- Bounds on three- and higher-distance sets (Q648975) (← links)
- Weight distribution of translates of MDS codes (Q749509) (← links)
- The weight distribution of the coset leaders for some classes of codes with related parity-check matrices (Q754156) (← links)
- Covering radius and dual distance (Q811480) (← links)
- A class of codes admitting at most three nonzero dual distances (Q811484) (← links)
- Completely regular codes and completely transitive codes (Q911558) (← links)
- Permutation codes (Q966159) (← links)
- On a generalization of distance sets (Q986118) (← links)
- 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 (Q1003680) (← links)
- Invariance of generalized wordlength patterns (Q1022004) (← links)
- On the covering radius of cyclic linear codes and arithmetic codes (Q1065761) (← links)
- Good coverings of Hamming spaces with spheres (Q1068057) (← links)
- Upper bounds for the cardinality of s-distances codes (Q1077373) (← links)
- Partitions and fuzziness (Q1078152) (← links)
- Codes with given distances (Q1094390) (← links)
- Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances (Q1104935) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Strongly regular graphs having strongly regular subconstituents (Q1144588) (← links)
- Remarks on tactical configurations in codes (Q1156768) (← links)
- On the parameters of codes for the Lee and modular distance (Q1176746) (← links)
- Cosets of an extremal binary code of the dimension 48 (Q1179913) (← links)
- Combinatorial properties of extremal doubly-even codes of length 48 (Q1189041) (← links)
- On \(r\)-partition designs in Hamming spaces (Q1189713) (← links)
- The covering radius of Hadamard codes in odd graphs (Q1199453) (← links)
- Unrestricted codes with the Golay parameters are unique (Q1218393) (← links)
- Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\) (Q1241419) (← links)
- Codes projectifs à deux poids, ''caps'' complets et ensembles de différences (Q1241489) (← links)
- Spherical codes and designs (Q1245838) (← links)
- Orthogonal arrays, primitive trinomials, and shift-register sequences (Q1273727) (← links)
- Metric coset schemes revisited (Q1296146) (← links)
- Weight distribution and dual distance (Q1320444) (← links)
- Weight distributions of linear codes and the Gleason-Pierce theorem (Q1331144) (← links)
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound (Q1356042) (← links)
- On the covering radius of an unrestricted code as a function of the rate and dual distance (Q1383375) (← links)
- On three weights in cyclic codes with two zeros. (Q1418185) (← links)
- Beyond the orthogonal array concept. (Q1427968) (← links)
- Tight 2-designs and perfect 1-codes in Doob graphs (Q1569871) (← links)
- Maximum weight spectrum codes (Q1726015) (← links)
- The covering radii of a class of binary cyclic codes and some BCH codes (Q1727346) (← links)
- How many weights can a linear code have? (Q1755995) (← links)
- On equidistant constant weight codes (Q1811100) (← links)
- Extremal self-dual \([40,20,8]\) codes with covering radius 7 (Q1827585) (← links)
- On cryptographic propagation criteria for Boolean functions (Q1854278) (← links)
- Equidistant families of sets (Q1899407) (← links)
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 40 (Q1978714) (← links)
- Binary Hamming codes and Boolean designs (Q2034991) (← links)