scientific article; zbMATH DE number 3577144
From MaRDI portal
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.
idempotentsassociation schemesBCH codesReed-Muller codesHadamard matricesfinite fieldslinear codesBibliographyfinite geometriesnonlinear codesperfect codesGoppa codesReed-Solomon codesinvariant theoryalternant codesself-dual codescyclic codesGolay codedual codesblock diagramsquadratic residue codesKerdock codesPreparata codesweight distributionsGolay codesMattson-Solomon polynomialsquality boundsJustesen codesSrivastava codescodes with maximum minimal distanceoperations on codestable of best codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94Bxx) Designs and configurations (05Bxx)
Related Items (only showing first 100 items - show all)
Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes ⋮ The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\) ⋮ Mutually disjoint \(t\)-designs and \(t\)-SEEDs from extremal doubly-even self-dual codes ⋮ Extension theorems for linear codes over finite fields ⋮ Recent results on designs with classical parameters ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ MacWilliams duality and a Gleason-type theorem on self-dual bent functions ⋮ The codes and the lattices of Hadamard matrices ⋮ Boolean functions optimizing most of the cryptographic criteria ⋮ Construction of quasi-cyclic self-dual codes ⋮ Complementary design theory for sliced equidistance designs ⋮ Self-dual codes from circulant matrices ⋮ Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes ⋮ Remoteness of permutation codes ⋮ Strong forms of orthogonality for sets of hypercubes ⋮ Affine equivalence of cubic homogeneous rotation symmetric functions ⋮ The minimum distance of parameterized codes on projective tori ⋮ Random low-degree polynomials are hard to approximate ⋮ New code equivalence based on relative generalized Hamming weights ⋮ On construction of involutory MDS matrices from Vandermonde matrices in \(\mathrm{GF}(2^q)\) ⋮ On sets of vectors of a finite vector space in which every subset of basis size is a basis. II ⋮ A Hamada type characterization of the classical geometric designs ⋮ Binary quasi-cyclic codes of index 2 and skew polynomial rings ⋮ On the existence of some specific elements in finite fields of characteristic 2 ⋮ Spherical coverage verification ⋮ Congruence conditions, parcels, and Tutte polynomials of graphs and matroids ⋮ Uniform fractional factorial designs ⋮ Differential approach for the study of duals of algebraic-geometric codes on surfaces ⋮ Multiplicative character sums and products of sparse integers in residue classes ⋮ On the construction of asymmetric quantum codes ⋮ Quantum private comparison based on phase encoding of single photons ⋮ Computing Walsh coefficients from the algebraic normal form of a Boolean function ⋮ Distribution of the sum-of-digits function of random integers: a survey ⋮ Generalizing Krawtchouk polynomials using Hadamard matrices ⋮ Hermitian-adjacency matrices and Hermitian energies of mixed graphs ⋮ Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ On calculation of the interweight distribution of an equitable partition ⋮ Planar functions over fields of characteristic two ⋮ Association schemes related to Delsarte-Goethals codes ⋮ MacWilliams extension theorems and the local-global property for codes over Frobenius rings ⋮ Efficient implementation of class-based decomposition schemes for naïve Bayes ⋮ Efficient quantum algorithms to construct arbitrary Dicke states ⋮ Transitive nonpropelinear perfect codes ⋮ Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs ⋮ Difference sets and positive exponential sums. I: General properties ⋮ Good \(p\)-ary quasic-cyclic codes from cyclic codes over \(\mathbb F_p+ v\mathbb F_p\) ⋮ Discrete norms of a matrix and the converse to the expander mixing lemma ⋮ Tree based symmetric key broadcast encryption ⋮ A circulant approach to skew-constacyclic codes ⋮ Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle ⋮ Symmetric bilinear forms over finite fields with applications to coding theory ⋮ Enhanced Boolean functions suitable for the filter model of pseudo-random generator ⋮ Binary codes and partial permutation decoding sets from the Johnson graphs ⋮ Asymptotic bounds on the equilateral dimension of hypercubes ⋮ Theta functions and symmetric weight enumerators for codes over imaginary quadratic fields ⋮ Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes ⋮ Explicit criterions for \(p\)-ary functions being non-bent ⋮ Bent vectorial functions and linear codes from o-polynomials ⋮ Differentially 4-uniform bijections by permuting the inverse function ⋮ Entanglement-assisted quantum codes from arbitrary binary linear codes ⋮ On sequences, rational functions and decomposition ⋮ Using error-correcting codes to construct solvable pebbling distributions ⋮ Isodual cyclic codes over finite fields of odd characteristic ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets ⋮ A class of three-weight linear codes and their complete weight enumerators ⋮ Complete weight enumerators of some linear codes from quadratic forms ⋮ Distinguishing two probability ensembles with one sample from each ensemble ⋮ Partial permutation decoding for MacDonald codes ⋮ New secondary constructions of bent functions ⋮ Optimal binary codes from trace codes over a non-chain ring ⋮ Three classes of binary linear codes with good parameters ⋮ Linear closures of finite geometries ⋮ On the depth spectrum of binary linear codes and their dual ⋮ On traceability property of equidistant codes ⋮ Improved partial permutation decoding for Reed-Muller codes ⋮ On metric properties of maps between Hamming spaces and related graph homomorphisms ⋮ On the nonlinearity of S-boxes and linear codes ⋮ New differentially 4-uniform permutations by modifying the inverse function on subfields ⋮ Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions ⋮ A new secret sharing scheme ⋮ An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding ⋮ Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small ⋮ Families of optimal packings in real and complex Grassmannian spaces ⋮ Complete weight enumerators of a family of three-weight linear codes ⋮ MacWilliams extension theorem for MDS codes over a vector space alphabet ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ On the direct construction of recursive MDS matrices ⋮ Towards a general construction of recursive MDS diffusion layers ⋮ Signature codes for noisy multiple access adder channel ⋮ A code-based group signature scheme ⋮ Construction and classification of \(\mathbb{Z}_{2^s}\)-linear Hadamard codes ⋮ Comparing decoding methods for quaternary linear codes ⋮ About some Hadamard full propelinear \((2t,2,2)\)-codes. Rank and kernel ⋮ On random subgraphs of Kneser graphs and their generalizations ⋮ New quantum codes from dual-containing cyclic codes over finite rings ⋮ Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes ⋮ A subspace covering problem in the \(n\)-cube ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ On linear codes admitting large automorphism groups
This page was built for publication:
