scientific article; zbMATH DE number 3577144

From MaRDI portal
Revision as of 10:03, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4146667

zbMath0369.94008MaRDI QIDQ4146667

N. J. A. Sloane, F. J. MacWilliams

Publication date: 1977


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transformInteraction balance for symmetrical factorial designs with generalized minimum aberrationEA-inequivalence of bent functionsInvolutory-multiple-lightweight MDS matrices based on Cauchy-type matricesInfinite families of 2-designs from a class of non-binary Kasami cyclic codesA generic construction of rotation symmetric bent functions\(\mathbb{Z}_4\mathbb{Z}_4 [u\)-additive cyclic and constacyclic codes] ⋮ Automorphism groups of the holomorphic vertex operator algebras associated with Niemeier lattices and the \(-1\)-isometriesSome constructions of quantum MDS codesNew families of self-dual codesNear-MDS codes from elliptic curvesCorrelations between the ranks of submatrices and weights of random codesA mass formula for self-dual permutation codesA three-class association scheme on the flags of a finite projective plane and a (PBIB) design defined by the incidence of the flags and the Baer subplanes in \(PG(2,q^ 2)\)A new presentation of Cheng-Sloane's \([32,17,8\)-code] ⋮ MDS and self-dual codes over ringsEigenvalues and expansion of bipartite graphsReduced complexity iterative decoding of 3D-product block codes based on genetic algorithmsPolynomial evaluation over finite fields: new algorithms and complexity boundsFamilies of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) othersOn identifying codes in binary Hamming spacesDNA sequence design using templatesNew bounds on the distance distribution of extended Goppa codesOn the number of sparse RSA exponentsOn a hypercube coloring problemThe poset structures admitting the extended binary Hamming code to be a perfect codeUniformity in factorial designs with mixed levelsA transform property of Kloosterman sumsCovering and radius-covering arrays: constructions and classificationConstructions of new families of nonbinary CSS codesReed-Muller codes and permutation decodingImproving bounds on the minimum Euclidean distance for block codes by inner distance measure optimizationResults on rotation-symmetric S-boxesOn quasi-cyclic codes as a generalization of cyclic codesMinimal cyclic codes of length \(p^nq\)The non-existence of Griesmer codes with parameters close to codes of Belov typeCodes arising from incidence matrices of points and hyperplanes in \(\mathrm{PG}(n, q)\)On codes over \(\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\)Some families of asymmetric quantum MDS codes constructed from constacyclic codesThe weight distributions of two classes of \(p\)-ary cyclic codes with few weightsMacWilliams type identities on the Lee and Euclidean weights for linear codes over \(\mathbb{Z}_\ell\)Algebraic decoding of the \((41, 21, 9)\) quadratic residue codeOn the decoding of binary cyclic codes with the Newton identitiesGeneralized quasi-cyclic codes: Structural properties and code constructionA strictly stationary, \(N\)-tuplewise independent counterexample to the central limit theoremOn proper secrets, \((t,k)\)-bases and linear codesFurther properties of several classes of Boolean functions with optimum algebraic immunityThe number of public keys in the McEliece-Sidel'nikov cryptosystemSets of complex unit vectors with few inner products and distance-regular graphsNew identities relating wild Goppa codesThe weight distributions of two classes of \(p\)-ary cyclic codesOn gaps between quadratic non-residues in the Euclidean and Hamming metricsOn second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\)The string guessing problem as a method to prove lower bounds on the advice complexity18-run nonisomorphic three level orthogonal arraysHamiltonian paths in distance graphsImprovement on asymptotic density of packing families derived from multiplicative latticesBounds on the dimension of codes and subcodes with prescribed contraction indexArcs and ovals in the Hermitian and Ree unitalsSearching with a forbidden lie pattern in responsesUpper bounds for football pool problems and mixed covering codesOn the non-existence of certain perfect mixed codesThe second eigenvalue of regular graphs of given girthThe exact bound in the Erdős-Ko-Rado theoremConstruction of the weight polynomial for autocorrelation of \(q\)-ary wordsCharacterizations of locally testable linear- and affine-invariant familiesLinear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraintThe 2-distance coloring of the Cartesian product of cycles using optimal Lee codesOn Frobenius incidence varieties of linear subspaces over finite fieldsAn alternative proof of a result on the weight divisibility of a cyclic code using supersingular curvesOn quaternary Goppa codesConstructions of abelian codes multiplying dimension of cyclic codesIsometry-dual flags of AG codesMonomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codesOn the 486-vertex distance-regular graphs of Koolen-Riebeek and SoicherOn the \(\Delta \)-equivalence of Boolean functionsOn some families of certain divisible polynomials and their zeta functionsOrthogonal line packings of \(PG_{2m-1}(2)\)Eight octads sufficeÜber die Wurzelschranke für das Minimalgewicht von CodesParameters of association schemes that are both P- and Q-polynomialOn the asymptotic behaviour of Lee-codesThe application of coding theory to the design of combinatorial filing schemes of any orderOn triple-sum-sets and two or three weights codesA combinatorial lemma and Shannon's theorem for binary symmetric channelsOdd and even Hamming spheres also have minimum boundaryOn a class of abelian codesOn matrix representations and codes associated with the simple group of order 25920The decoding of extended Reed-Solomon codesGeneralized bounds and binary/ternary mixed packing and covering codesA characterization of some minihypers in a finite projective geometry PG(t,4)Hecke operators and the weight distributions of certain codesArtin-Schreier curves and codesIntersection of the Steiner systems of \(M_{24}\)Covering radius and dual distanceA class of codes admitting at most three nonzero dual distancesNew techniques for constructing \(t\)-EC/\(d\)-ED/AUED and \(t\)-EC/\(d\)-ED/\(s\)-UED codesCharacterization of minimum aberration mixed factorials in terms of consulting designsOptimal tristance anticodes in certain graphsMajorization framework for balanced lattice designs







This page was built for publication: