Publication:4146667

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory

94Bxx: Theory of error-correcting codes and error-detecting codes

05Bxx: Designs and configurations

Related Items

STS-graphs of perfect codes mod kernel, Correcting errors and erasures via the syndrome variety, Combinatorial aspects of jump codes, Point sets and sequences with small discrepancy, Some simple consequences of coding theory for combinatorial problems of packings and coverings, Zeros of generalized Krawtchouk polynomials, On subsets with cardinalities of intersections divisible by a fixed integer, Algebraic techniques for nonlinear codes, New cyclic difference sets with Singer parameters, Matrix structure and loss-resilient encoding/decoding, Tight bounds for FEC-based reliable multicast, Decoding turbo-like codes via linear programming, An algorithm for ``Ulam's Game and its application to error correcting codes, On quasilinear-time complexity theory, On covering problems of codes, Shortened and punctured codes and the MacWilliams identities, Orthogonal partitions in designed experiments, Codes based on complete graphs, Double circulant codes over $\mathbb{Z}_ 4$ and even unimodular lattices, Almost MDS codes, On the $p$-rank of the adjacency matrices of strongly regular graphs, A Graham-Sloane type construction for $s$-surjective matrices, The automorphism group of Generalized Reed-Muller codes, A spanning tree of the $2^ m$-dimensional hypercube with maximum number of degree-preserving vertices, On MDS elliptic codes, The covering radius of the cycle code of a graph, Genetic algorithms in coding theory -- a table for $A_ 3(n, d)$, Highly symmetric subgraphs of hypercubes, A 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], Families of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others, On identifying codes in binary Hamming spaces, DNA sequence design using templates, New bounds on the distance distribution of extended Goppa codes, On the number of sparse RSA exponents, On a hypercube coloring problem, The poset structures admitting the extended binary Hamming code to be a perfect code, Uniformity in factorial designs with mixed levels, Bounds on the dimension of codes and subcodes with prescribed contraction index, Arcs and ovals in the Hermitian and Ree unitals, Searching with a forbidden lie pattern in responses, Upper bounds for football pool problems and mixed covering codes, On the non-existence of certain perfect mixed codes, The second eigenvalue of regular graphs of given girth, The exact bound in the Erdős-Ko-Rado theorem, Orthogonal line packings of $PG_{2m-1}(2)$, Eight octads suffice, Über die Wurzelschranke für das Minimalgewicht von Codes, Parameters of association schemes that are both P- and Q-polynomial, On the asymptotic behaviour of Lee-codes, The application of coding theory to the design of combinatorial filing schemes of any order, On triple-sum-sets and two or three weights codes, A combinatorial lemma and Shannon's theorem for binary symmetric channels, Odd and even Hamming spheres also have minimum boundary, On a class of abelian codes, On matrix representations and codes associated with the simple group of order 25920, The decoding of extended Reed-Solomon codes, Generalized bounds and binary/ternary mixed packing and covering codes, A characterization of some minihypers in a finite projective geometry PG(t,4), Hecke operators and the weight distributions of certain codes, Artin-Schreier curves and codes, Intersection of the Steiner systems of $M_{24}$, Covering radius and dual distance, A class of codes admitting at most three nonzero dual distances, New techniques for constructing $t$-EC/$d$-ED/AUED and $t$-EC/$d$-ED/$s$-UED codes, Characterization of minimum aberration mixed factorials in terms of consulting designs, Optimal tristance anticodes in certain graphs, Majorization framework for balanced lattice designs, Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform, Interaction balance for symmetrical factorial designs with generalized minimum aberration, Quadratic-residue codes and cyclotomic fields, Scalable and systolic architecture for computing double exponentiation over $\text{GF}(2^m)$, DFT for cyclic code over $F_p+ uF_p+\cdots+ u^{k-1}F_p$, Binary codes from rectangular lattice graphs and permutation decoding, MacWilliams-type identities for fragment and sphere enumerators, On the integrality of $n$th roots of generating functions, A lemma on polynomials modulo $p^m$ and applications to coding theory, The chromatic number and rank of the complements of the Kasami graphs, Projection properties of Hadamard matrices of order 36 obtained from Paley's constructions, Minimum secondary aberration fractional factorial split-plot designs in terms of consulting designs, On modular cyclic codes, Nonlinearities of S-boxes, On puncturing of codes from norm-trace curves, BCH codes and distance multi- or fractional colorings in hypercubes asymptotically, The divisibility modulo 24 of Kloosterman sums on $\text{GF}(2^m)$, $m$ odd, Permutation groups and binary self-orthogonal codes, A characterization of Delsarte's linear programming bound as a ratio bound, On linear codes whose weights and length have a common divisor, Analytic solutions for three taxon ML trees with variable rates across sites, On the asymptotic number of inequivalent binary self-dual codes, Roots of random polynomials over a finite field, Nonexistence of near-extremal formally self-dual even codes of length divisible by 8, Square classes of totally positive units, Self-orthogonal designs and extremal doubly even codes, On primitive polynomials over finite fields, On automorphisms of geometric Goppa codes, The parameters of projective Reed-Müller codes, Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20, Completely regular codes and completely transitive codes, Analysis of Euclidean algorithms for polynomials over finite fields, De Bruijn sequences, irreducible codes and cyclotomy, Degree conditions for vertex switching reconstruction, GAS, a concept on modeling species in genetic algorithms, Neither reading few bits twice nor reading illegally helps much, Observations on a class of nasty linear complementarity problems, Center sets and ternary codes, Sets of even type in PG(3,4), alias the binary (85,24) projective geometry code, An interactive program for finite incidence structures, Divisible codes, Il n'y à pas de $[q+1,2$ MDS code cyclique d'ordre impair $q$], The binary GOLAY code obtained from an extended cyclic code over $\mathbb{F}_8$, Planes of order 10 do not have a collineation of order 5, The biweight enumerator of self-orthogonal binary codes, Incidence codes of posets: Eulerian posets and Reed-Muller codes, A new construction of the binary Golay code (24, 12, 8) using a group algebra over a finite field, A good method of combining codes, Codes with prescribed permutation group, A generalized weight for linear codes and a Witt-MacWilliams theorems, The smallest length of binary 7-dimensional linear codes with prescribed minimum distance, A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines, On the weight distribution of spherical t-designs, Remarks on tactical configurations in codes, The nonexistence of a certain Steiner system S(3,12,112), Codes and designs, On distance-regularity in graphs, Cycle decompositions of complete graphs, Binary images of some self-dual codes over GF($2^ m)$ with respect to trace-orthogonal basis, Self-dual codes over GF(5), On primes dividing the group order of a doubly-even $(72,36,16)$ code and the group order of a quaternary $(24,12,10)$ code, On primitive elements of trace equal to 1 in GF($2^ m)$, Codes autoduaux principaux et groupe d'automorphismes de l'algèbre $A=F_{2^r}[X_1,-,X_n/(X_1^2-1,-,X_n^2-1)$], Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound, A global code invariant under the Higman-Sims group, New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems, Codes with the same Lee weight enumerator are isometric, Zyklische lineare optimale (n,2)-Codes, Fuzzy codes and distance properties, On norm three vectors in integral Euclidean lattices. I, A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound, On the complexity of multiplication in finite fields, An $E_ 8-$approach to the Leech lattice and the Conway group, Artin-Schreier curves, exponential sums, and the Carlitz-Uchiyama bound for geometric codes, On the parameters of codes for the Lee and modular distance, On zero-testing and interpolation of $k$-sparse multivariate polynomials over finite fields, Constructing self-dual codes using graphs, Bruck nets, codes, and characters of loops, Cosets of an extremal binary code of the dimension 48, A note on the covering radius of optimum codes, New approaches to reduced-complexity decoding, Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6, The parameters of subcodes of algebraic-geometric codes over prime subfields, Polynomial description of binary linear codes and related properties, Hyperelliptic function fields and codes, Linear cyclic codes of wordlength $v$ over $GF(q^ s)$ which are also linear cyclic codes of wordlength $sv$ over $GF(q)$, Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound, Blocking sets in finite projective spaces and uneven binary codes, A characterization of $\{ 2\upsilon{}_{\alpha{}+1}+2\upsilon{}_{\beta{}+1},2\upsilon_ \alpha{}+2\upsilon{}_ \beta{} ;t,q\}$-minihypers in PG$(t,q)(t\geq 2,q\geq 5$ and $0\leq\alpha{}<\beta{}<t)$ and its applications to error- correcting codes, Legendre sums and codes related to QR codes, Linear sections of the general linear group: A geometric approach, On the maximum cardinality of binary constant weight codes with prescribed distance, On the simplicity of $\cdot 2$ and $\cdot 3$, A combinatorial problem for vector spaces over finite fields, On even codes, On symmetric and quasi-symmetric designs with the symmetric difference property and their codes, Cyclic and pseudo-cyclic MDS codes of length $q + 1$, The weight distribution of indecomposable cyclic codes over 2-groups, Inclusion transformations: $(n,m)$-graphs and their classification, Universal forecasting algorithms, Combinatorial properties of extremal doubly-even codes of length 48, On $r$-partition designs in Hamming spaces, Artin-Schreier curves, exponential sums, and coding theory, Minimum distance of elliptic codes, The binary self-dual codes of length up to 32: A revised enumeration, Almost all self-dual codes are rigid, $t$-sum generators of finite Abelian groups, Sets of typical subsamples, Self-dual codes based on the twin prime product 35, Efficient ID-based key distribution with tamperfree devices, A characterization of some $\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}$-minihypers and some $(n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)$-codes $(k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)$ meeting the Griesmer bound, Self-orthogonal codes with distance four are not rigid, On the intersection rank of a graph, Connectivity, persistence and fault diagnosis of interconnection networks based on $O_ k$ and $2O_ k$ graphs, The covering radius of Hadamard codes in odd graphs, Application of coding theory to interconnection networks, The $[18,9,6$ code is unique], Complete $k$-arcs in PG($n,q$), $q$ even, On the cardinality of sets of sequences with given maximum correlation, On the weight enumerator of product codes, Sum-free sets in vector spaces over $GF(2)$, Optimal ternary quasi-cyclic codes, Optimal ternary linear codes, Generating bent sequences, New binary codes from a generalization of Zinoviev's technique, Polynomial-time construction of codes. I: Linear codes with almost equal weights, The number of solutions of certain diagonal equations over finite fields, Designs as maximum codes in polynomial metric spaces, The $k$-orbit reconstruction and the orbit algebra, On a complete decoding scheme for binary radical codes, Dense polynomial multiplication with reduced array manipulation overhead, On the dimension of Goppa codes, Binary set functions and parity check matrices, On two conjectures about set-graceful graphs, Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonné. (Affine-invariant extended cyclic codes and antichains of a partially ordered set.), Applications of coding theory to communication combinatorial problems, Spinor groups and algebraic coding theory, Extremal doubly-even codes of length 64 derived from symmetric designs, Some optimal codes from algebraic geometry and their covering radii, The extended Golay codes considered as ideals, The minimum weight of the Grassmann codes C(k,n), An efficient semi-Latin square for twelve treatments in blocks of size two, On the equivalence of codes and codes with an automorphism having two cycles, A new upper bound on nonbinary block codes, Factorization of symmetric circulant matrices in finite fields, On the Delsarte-Goethals codes and their formal duals, Primitive elements and polynomials with arbitrary trace, The structured design of cryptographically good s-boxes, Low complexity normal bases, State space realizations and monomial equivalence for convolutional codes, Two-weight ternary codes and the equation $y^2=4 \times 3^\alpha+13$, A note on the probabilistic approach to Turan's problem, Information sets in quadratic-residue codes, A characterization of designs related to the Witt system S(5,8,24), Configurations: A case study in mathematical beauty, Formulation of multiple-choice situations in linear programming models using binary coding matrices, On the nonexistence of certain M.D.S. codes and projective planes, Reconstruction from vertex-switching, Hadamard matrices of order 28 with automorphisms of order 7, The (16,6,2) biplane with 60 ovals and the weight distribution of a code, On the covering radius of cyclic linear codes and arithmetic codes, On the nonbinary Johnson scheme, A description of some extended cyclic codes with application to Reed- Solomon codes, Generalized threshold decoding of cyclic codes, Good coverings of Hamming spaces with spheres, On the Steiner system S(2,4,28) and codes associated with the simple group of order 6048, Coding scheme for a wire-tap channel using regular codes, A class of doubly even self dual binary codes, Self-dual doubly circulant codes, Orthogonal polynomials - Constructive theory and applications, Finite unimodular groups of prime degree and circulants, Special algorithms for convolutions over Galois fields, Linear intersecting codes, On the cosets of the simplex code, Important algebraic calculations for $n$-variables polynomial codes, Finite field transforms and symmetry groups, A sublattice of the Leech lattice, On an infinite class of Steiner systems with $t=3$ and $k=6$, Coefficients of primitive polynomials, Upper bounds for the cardinality of s-distances codes, On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e$\geq 3$ and q$\geq 3$, An improvement of the Griesmer bound for some small minimum distances, Every finite group is the automorphism group of some perfect code, Reconstructing the ternary Golay code, Über die Identität von MacWilliams für die Gewichtsfunktion von Codes, A new approach to the covering radius of codes, The enumeration of symmetric circulants of fixed rank over a finite field, Lattices with theta functions for G($\sqrt{2})$ and linear codes, Coherent algebras, The automorphism groups of Reed-Solomon codes, Algebraic aggregation theory, Zwei unzulässige Verstärkungen der Vermutung von Wilkinson. (Two inadmissible amplifications of Wilkinson's conjecture), A group algebra construction of binary even self dual codes, WOM-codes construits à partir des codes de Hamming, Upper bounds for constant weight and Lee codes slightly outside the Plotkin range, Note sur la notion d'équivalence entre deux codes linéaires, Combinatorial reconstruction problems, Some lower bounds for constant weight codes, Characterization and synthesis of self-complementary normal bases in finite fields, Examples of even unimodular extremal lattices of rank 40 and their Siegel theta-series of degree 2, Constructive high-dimensional sphere packings, Exact results for deterministic cellular automata with additive rules, A note on the computation of the bit error rate for binary block codes, Quasi-symmetric designs and self-dual codes, On a set of lines of $PG(3,q)$ corresponding to a maximal cap contained in the Klein quadric of $PG(5,q)$., Quasi-symmetric $2\text{-}(31,7,7)$ designs and a revision of Hamada's conjecture, Selbstduale Codes über dem Ring der ganzen Zahlen modulo 4. (Self-dual codes over the ring of integers modulo 4), A characterization of designs related to dodecads in the Witt system S(5,8,24), On the MacWilliams identities for linear codes, On linear MDS codes of length $q+1$ over GF(q) for even q, The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x-$\alpha$ )(x- $\alpha$ 2)(x-$\alpha$ 3), One-step completely orthogonalizable codes from generalized quadrangles, The application of invariant theory to the existence of quasi-symmetric designs, Applications of coding theory to the design of somatic cell hybrid panels, On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre, Self-dual Goppa codes, Vandermonde and Wronskian matrices over division rings, Eine Invarianzgruppe für die vollständige Gewichtsfunktion selbstdualer Codes, A new concatenated BCH-matrix type-B code, Characterization of $\{(q+1)+2,1;t,q\}-\min \cdot hypers$ and $\{2(q+1)+2,2;2,q\}-\min \cdot hypers$ in a finite projective geometry, The complexity of a periodic sequence over GF(p), A t-unidirectional error-detecting systematic code, The weights of the dual code of the MELAS code over GF(3), Hermitian congruence and the existence of completion of generalized Hadamard matrices, Which extended Goppa codes are cyclic?, Some sample path properties of a random walk on the cube, Detecting errors in searching games, Characterization of $\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}$-min$\cdot hypers$ and its applications to error-correcting codes, Characterization of $\{2(q+1)+2,2;t,q\}$-$\min \cdot hypers$ in PG(t,q) (t$\geq 3,q\geq 5)$ and its applications to error-correcting codes, A characterization of $\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}$-min$\cdot hypers$ and its applications to error-correcting codes and factorial designs, Structure of parallel multipliers for a class of fields $GF(2^ m)$, Définition et caractérisation d'une dimension minimale pour les codes principaux nilpotents d'une algèbre modulaire de p-groupe abélien élémentaire. (Definition and characterization of a minimal dimension for the nilpotent principal codes of a modular algebra of the elementary Abelian p-group), The number of MDS [7,3 codes on finite fields of characteristic 2], On $Q$-ary images of self-dual codes, On minimum distance bounds for abelian codes, Codes for detecting and correcting propagation errors, Self-dual codes over the integers modulo 4, An improved Bombieri-Weil bound and applications to coding theory, Super-visible codes, Extremal self-dual codes from symmetric designs, A characterization of some $\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}$-minihypers and some $(v_ k-30,k,3^{k-1}-21;3)$-codes meeting the Griesmer bound, At the dawn of the theory of codes, Kanonische Codes auf einigen Überdeckungskurven, Codes over GF(4) and complex lattices, Self-dual codes over GF(4), On an inverse for sections of a binomial matrix, On the distance distribution of homogeneous codes, Cryptology: The mathematics of secure communication, Combinatorial polarization, The $GF(p)$-dimension of the codes generated by the classical point-line geometries over $GF(p)$, How to avoid the cheaters succeeding in the key sharing scheme, The automorphism groups of the Delsarte-Goethals codes, Bounds for binary multiple covering codes, A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min$\cdot hyper$ in a finite projective geometry, On the number of solutions of polynomial systems, Extending and lengthening BCH codes., Minimal codes of prime-power length., The existence of a self-dual $[70 ,35 ,12$ code and formally self-dual codes.], New generalized cyclotomy and its applications, Some systems of diagonal equations over finite fields, $q$-ary bent functions constructed from chain rings, Secant spaces and Clifford's theorem over finite fields, Characterization of certain minimal rank designs, On codes with the identifiable parent property, Decompositions of complete multigraphs related to Hadamard matrices, A $p$-adic Serre bound, Orthogonal arrays, primitive trinomials, and shift-register sequences, Perfectly secure key distribution for dynamic conferences, On the hardness of approximating shortest integer relations among rational numbers, Merit factors and Morse sequences, On the nonexistence of extremal self-dual codes, On the Hamming weight enumerators of self-dual codes over $\mathbb{Z}_k$, Construction of 2-designs, Minimal cyclic codes of length $2p^n$, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications, $q$-ary Gray codes and weight distributions, Modular invariance property of association schemes, type II codes over finite rings and finite abelian groups and reminiscences of François Jaeger (a survey), Symmetric flows and broadcasting in hypercubes, Metric coset schemes revisited, Gauss sums, Jacobi sums, and $p$-ranks of cyclic difference sets, New infinite families of 3-designs from Preparata codes over $\mathbb{Z}_4$, Indecomposability of cyclic codes, Extremal double circulant type II codes over $\mathbb Z_4$ and construction of 5-(24,10,36) designs., On the nonexistence of some quaternary linear codes meeting the Griesmer bound, The nonexistence of ternary [79, 6, 51 codes], The packing problem in statistics, coding theory and finite projective spaces, Matroid representations by partitions, Some codes related to BCH-codes of low dimension, Type II self-dual codes over finite rings and even unimodular lattices, Matrix characterization of MDS linear codes over modules., Self-dual bases in $\mathbb{F}_{q^ n}$, Two new decoding algorithms for Reed-Solomon codes, Character sum constructions of constrained error-correcting codes, Finding irreducible and primitive polynomials, Quasi-symmetric designs, codes, quadrics, and hyperplane sections, On the majority decodable distance of codes in filtrations of characteristic $p>0$, On the covering radius of Reed-Solomon codes, Weight class distributions of de Bruijn sequences, Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables, Weight distribution and dual distance, A simple method to estimate the maximum nontrivial correlation of some sets of sequences, Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others, On the $[28,7,12$ binary self-complementary codes and their residuals], On row-cyclic codes with algebraic structure, Classification of cosets of the Reed-Muller code $R(m-3,m)$, $k$-arcs and dual $k$-arcs, Period distribution for error-correcting codes, Quadratic residue codes and cyclotomic lattices, A survey of partial difference sets, Combinatorial techniques for universal hashing, Cube-tilings of $\mathbb{R}^ n$ and nonlinear codes, New upper bounds for the football pool problem for 11 and 12 matches, On self-dual affine-invariant codes, On weight spaces of polynomial representations of the general linear group as linear codes, Designs with the symmetric difference property on 64 points and their groups, Weight distributions of linear codes and the Gleason-Pierce theorem, On $(p,1)$-subnormal $q$-ary covering codes, The edge-forwarding index or orbital regular graphs, Divisors of codes of Reed-Muller type, The effective length of subcodes, Projective planes of order $q$ whose collineation groups have order $q^ 2$, Factoring of $x^ n -1$ and orthogonalization over finite fields of characteristic 2, A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers, The probabilistic method yields deterministic parallel algorithms, Combinatorial $S_ n$-modules as codes, On quasi-symmetric 2-(28, 12, 11) and 2-(36, 16, 12) designs, Search problems: One, two or many rounds, Some combinatorial-algebraic problems from complexity theory, Cyclic codes of length $2^m$, The MacWilliams theorem for two-dimensional modulo metrics, Long binary narrow-sense BCH codes are normal, Improved identification schemes based on error-correcting codes, Dual codes of systematic group codes over abelian groups, On the hardness of computing the permanent of random matrices, Applications of coding theory to the construction of modular lattices, Quasi-symmetric designs and codes meeting the Grey-Rankin bound, Weight enumerators of codes derived from polynomial product algorithms, On Srivastava's problems and the properties of Hadamard matrices, On the scalar rational interpolation problem, Eigenvalues, eigenspaces and distances to subsets, Optimal constant weight codes over $Z_k$ and generalized designs, Two applications of separating systems to nonadaptive procedures, Some transitive Steiner triple systems of Bagchi and Bagchi, Space-filling subsets of a normal rational curve, Steiner triple systems of order 15 and their codes, Self-dual codes which are principal ideals of the group algebra $\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}$], Uniqueness of $[87,5,57; 3$-codes and the nonexistence of $[258,6,171; 3]$-codes], A characterization of some $\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}$-minihypers and some $[15,4,9; 3$-codes with $B_ 2=0$], A characterization of some $\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}$-minihypers and its applications to error-correcting codes, A linear programming bound for orthogonal arrays with mixed levels, Note on Draper and Lin's article Capacity considerations for two-level fractional factorial designs, Decoding of Reed Solomon codes beyond the error-correction bound, Symplectic groups, symplectic spreads, codes, and unimodular lattices, Semidefinite programming in combinatorial optimization, An application of difference sets to a problem concerning graphical codes, Exact learning of linear combinations of monotone terms from function value queries, Theory and use of functionals on the class of nonnegative polynomials and quadrature formulae, Linear codes and the existence of a reversible Hadamard difference set in $\mathbb{Z}_ 2\times \mathbb{Z}_ 2\times \mathbb{Z}_ 5^ 4$, Tight approximations for resource constrained scheduling and bin packing, Polynomial invariants of groups associated to configurations of hyperplanes over finite fields, New classes of residue supplementary difference systems, Results on bent functions, Intersection of isomorphic linear codes, Ternary covering codes derived from BCH codes, A large family of sequences with low periodic correlation, Cyclic arcs and pseudo-cyclic MDS codes, Complete arcs, Classical arcs in $PG(r,q)$ for $11\leq q\leq 19$, New upper bounds for binary covering codes, Cyclic codes over finite rings, On the covering radius of an unrestricted code as a function of the rate and dual distance, Algebraic representation of affine MDS-codes and mutually orthogonal Latin squares, On the expectation and variance of Hamming distance between two i. i. d. random vectors, Studies on the squaring construction, 2-modular lattices from ternary codes., On saturating sets in projective spaces., Sudan-decoding generalized geometric Goppa codes., On viewing block codes as finite automata., Rings and constructions of partial difference sets, Characterization of binary type II codes from the $[8,4,4$ extended Hamming code], Minimal cyclic codes of length $p^{n} q$., Stationary Gaussian processes on the vertices of the $k$-cube., Generalized hashing and parent-identifying codes., Type II codes over $\mathbb{F}_{2^m} + u\mathbb{F}_{2^m}$, New minimum distance bounds for linear codes over GF(5)., Permutation decoding for the binary codes from triangular graphs., Trivial two-stage group testing for complexes using almost disjunct matrices., Some results on generalized minimum aberration for symmetrical fractional factorial designs., A note on optimal foldover design., On the Gröbner bases of some symmetric systems and their application to coding theory., Euclidean and Hermitian self-dual MDS codes over large finite fields., Splitting systems and separating systems., On some properties of the hyper-Kloosterman codes, Some results on generalised Whitney functions, The complete weight enumerator for codes over $\mathcal M_{n\times s}(R)$, A class of generalized cyclic codes, 3-colored 5-designs and $\mathbb{Z}_4$-codes, Tight 2-designs and perfect 1-codes in Doob graphs, Clues to the hidden nature of de Bruijn sequences, Constructions of low rank relative difference sets in 2-groups using Galois rings, Some binary maximin distance designs, On the optimality of orthogonal arrays in case of correlated errors, On self-dual ternary codes and their coordinate ordering., Secret-sharing with a class of ternary codes, Theory of optimal blocking of $2^{n-m}$ designs, Nonexistence of extremal doubly even self-dual codes with large length, Classification of extremal double-circulant self-dual codes of length up to $62$, The extremal codes of length 42 with automorphism of order 7, On binary $k$-paving matroids and Reed-Muller codes, On the dual distance and the gap of a binary code, Perfect two-fault tolerant search with minimum adaptiveness, $\mathbb Z_8$-cyclic codes and quadratic residue codes, Lower bound for the linear multiple packing of the binary Hamming space, A uniform asymptotic expansion for Krawtchouk polynomials, On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes, Duadic $\mathbb{Z}_4$-codes, A Gleason formula for Ozeki polynomials, The key equation for one-point codes and efficient error evaluation, A fast correlation attack on LILI-128, Hyperplane sections of Grassmannians and the number of MDS linear codes, Spectral domain analysis of correlation immune and resilient Boolean functions, Quadratic double circulant codes over fields, Distribution of inverses in polynomial rings, Cryptographically significant Boolean functions with five valued Walsh spectra, Frameproof codes against limited coalitions of pirates, Linear codes are hard for oblivious read-once parity branching programs, Lower bounds for linearly transformed OBDDs and FBDDs, Type II codes over $\mathbb F_4$, Gröbner basis solutions of constrained interpolation problems, On bounds for codes over Frobenius rings under homogeneous weights, $\mathbb F_q$-linear cyclic codes over $\mathbb F_{q^m}$: DFT approach, Run distribution in nonlinear binary generators., Multistratum fractional factorial split-plot designs with minimum aberration and maximum estimation capacity, Higher power residue codes and the Leech lattice, On some self-dual codes and unimodular lattices in dimension 48, Codes over $\mathbb F_4$, Jacobi forms and Hilbert-Siegel modular forms over $\mathbb Q(\sqrt 5)$, Partial permutation decoding for codes from finite planes, Linear constructions for DNA codes, A characterization of some $[n,k,d;q$-codes meeting the Griesmer bound using a minihyper in a finite projective geometry], A construction of some $[n,k,d;q$-codes meeting the Griesmer bound], A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters, Incomplete sums, DC-constrained codes, and codes that maintain synchronization, Codes of Steiner triple and quadruple systems, Characterizations of generators for modified de Bruijn sequences, Structural properties and enumeration of quasi cyclic codes, On a signal processing algorithms based class of linear codes, A design and a code invariant under the simple group $Co_ 3$, On perfect $t$-shift codes in abelian groups, On upper bounds for code distance and covering radius of designs in polynomial metric spaces, Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes, Mac Williams identities and coordinate partitions, Expanding and forwarding, Error-correcting codes associated with complex Hadamard matrices, New codes via the lengthening of BCH codes with UEP codes, Higher weights of anticodes and the generalized Griesmer bound., Polynomial construction of complex Hadamard matrices with cyclic core, A universal bound for a covering in regular posets and its application to pool testing, Cyclic codes of length $2^e$ over $\mathbb Z_4$., On the non-minimal codewords in binary Reed-Muller codes, Intersecting codes and separating codes, A Griesmer bound for linear codes over finite quasi-Frobenius rings, The average dimension of the hull of cyclic codes., Bit-optimal decoding of codes whose Tanner graphs are trees, Some constacyclic codes over ${\mathbb Z}_{2^k}$ and binary quasi-cyclic codes., Polynomial spaces, Bouquets of geometric lattices: Some algebraic and topological aspects, Association schemes on triples and a ternary algebra, On Singleton arrays and Cauchy matrices, Local statistics for random domino tilings of the Aztec diamond, On the ring of simultaneous invariants for the Gleason-MacWilliams group, Multidiameters and multiplicities, Completely transitive codes in Hamming graphs, An Erdős-Ko-Rado theorem for regular intersecting families of octads, Maximum-length sequences, cellular automata, and random numbers, On weights in duadic codes, Hadamard matrices and doubly even self-dual error-correcting codes, An efficient algorithm for deciding quadratic residuosity in finite fields $GF(p^ m)$, Coding for write-unidirectional memories and conflict resolution, Flag algebras of symmetric design, Gray codes for reflection groups, A family of group character codes, Characterizing imprimitive partition designs of binary Hamming graphs, Linear recurrences with polynomial coefficients, On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions, Highly nonlinear mappings, Normal Boolean functions, Caps of order 3$q^{2}$ in affine 4-space in characteristic 2, Extremal self-dual $[40,20,8$ codes with covering radius 7], Miscellaneous classification results for 2-designs, Ternary codes and Jacobi forms, Binary codes from graphs on triples, MDS codes over $\mathbb{F}_9$ related to the ternary Golay code, Linear representations of cotriangular spaces, A note on the existence of special Laguerre i-structures and optimal codes, Some sporadic geometries related to PG(3,2), The packing problem for projective geometries over GF(3) with dimension greater than five, A note on orthogonal circulant matrices over finite fields, Metacyclic error-correcting codes, Generalized minimum aberration for asymmetrical fractional factorial designs, Generalized minimum aberration for asymmetrical fractional factorial designs., On the balancedness of nonlinear generators of binary sequences., Strand design for biomolecular computation., On cryptographic propagation criteria for Boolean functions, Further results on asymmetric authentication schemes, An algebra of discrete channels that involve combinations of three basic error types, On the doubly transitive permutation representations of $\text{Sp}(2n,\mathbb{F}_2)$., Transitive permutation groups of prime-squared degree, Maximum distance separable codes in the $\rho$ metric over arbitrary alphabets, On the natural representation of $S({\Omega})$ into $L ^{2}(\mathcal{P}({\Omega)})$ : Discrete harmonics and Fourier transform, MDS self-dual codes over large prime fields, Weight of duals of BCH codes and exponential sums, Recurrent methods for constructing irreducible polynomials over $\mathbb F_{q}$ of odd characteristics., A characterization of primitive polynomials over finite fields., Extremal doubly-even $[80,40,16$ codes with an automorphism of order 19], Connections among nonlinearity, avalanche and correlation immunity, A unified approach in addition or deletion of two level factorial designs., Algebraic testing and weight distributions of codes., Linear codes with complementary duals meet the Gilbert-Varshamov bound, Multiplicity of zeros and discrete orthogonal polynomials, On multi-partition communication complexity, Torus actions on manifolds of positive sectional curvature., Random sampling and approximation of MAX-CSPs, A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index, The nonexistence of ternary $[105,6,68$ and $[230,6,152]$ codes], Theory of minimum aberration blocked regular mixed factorial designs, Minimum aberration majorization in non-isomorphic saturated designs, Tough Ramsey graphs without short cycles, Modular and $p$-adic cyclic codes, The existence of extremal self-dual [50,25,10 codes and quasi-symmetric 2-(49,9,6) designs], On paving matroids and a generalization of MDS codes, A (105,10,47) binary quasi-cyclic code, A new sphere packing in 20 dimensions, An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions, A coding theoretic approach to extending designs, Uniqueness of strongly regular graphs having minimal $p$-rank, Solving $XX^{tr}=A$ over the integers, The cocycle lattice of binary matroids. II, $\mathbb{Z}_ 4$-linear codes obtained as projections of Kerdock and Delsarte-Goethals codes, The weight hierarchy of the Kasami codes, Permuted difference cycles and triangulated sphere bundles, On near-MDS codes, Two new bounds on the size of binary codes with a minimum distance of three, An updated table of rate $1/p$ binary quasi-cyclic codes, Linear codes interpolation from noisy patterns by means of a vector quantization process, Are fifth-degree equations over $GF(5^ m)$ solvable by radicals?, Characterizing the structures of cryptographic functions satisfying the propagation criterion for almost all vectors, Codes with a poset metric, Bent functions and random Boolean formulas, Two new optimal ternary two-weight codes and strongly regular graphs, Asymptotic estimation of the minimum distance of the duals of BCH codes and Dickson polynomials, The uniformly packed binary $[27, 21, 3 $ and $[35, 29, 3 ]$ codes], The spectrum of symmetric Krawtchouk matrices, Arcs in $\mathrm{PG}(n,q)$ fixed by $A_5$ and $A_6$, Synthesis of a minimal shift register with linear feedback and prescribed state cycle, On-line/off-line digital signatures, Linear recurring sequences over rings and modules, On the existence of error-correcting pairs, Generalized $H$-codes and doubly even self-dual binary codes, The nonexistence of $[71,5,46;3$-codes], The equivalence of two cyclic objects on $pq$ elements, Operator calculus approach to orthogonal polynomial expansions, Fast decoding of non-binary first order Reed-Muller codes, Combinatorial methods in the construction of point sets with uniformity properties, A new two-weight code and strongly regular graph, On the existence of saturated and nearly saturated asymmetrical orthogonal arrays, A series of identities for the coefficients of inverse matrices on a Hamming scheme, Communication complexity in a 3-computer model, An application of coding theory to a problem in graphical enumeration, Two families of low-correlated binary sequences, Two results on the bit extraction problem, Pieces of eight: semiselfdual lattices and a new foundation for the theory of Conway and Mathieu groups, A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations, Asymptotically optimal erasure-resilient codes for large disk arrays., On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects, An introduction to cocyclic generalised Hadamard matrices, Homogeneous bent functions, Strengthening the Gilbert-Varshamov bound, New linear codes over GF(8), Optimization algorithms and cyclic designs, Threshold data structures and coding theory, On covering radii and coset weight distributions of extremal binary self-dual codes of length 40, On the construction of irreducible self-reciprocal polynomials over finite fields, On the distribution of values of recurring sequences and the Bell numbers in finite fields, Dual distances of completely regular codes, Dense memory with high order neural networks, Multidimensional stochastic matrices and error-correcting codes, Conservative weightings and ear-decompositions of graphs, Hyper-bent functions and cyclic codes, Parametrization of self-dual codes by orthogonal matrices, Crooked maps in $\mathbb F_{2^n}$, Decoding interleaved Reed-Solomon codes over noisy channels, The cell probe complexity of succinct data structures, Self-dual codes over $\mathbb{Z}_8$ and $\mathbb{Z}_9$, On universally decodable matrices for space-time coding, New classes of self-complementary codes and quasi-symmetric designs, A result on the weight distributions of binary quadratic residue codes, Improved lower bounds on sizes of single-error correcting codes, The linear programming bound for codes over finite Frobenius rings, Maximal partial packings of $\mathbb Z_2^n$ with perfect codes, Butson Hadamard matrices with partially cyclic core, Minimal quadratic residue cyclic codes of length $2^n$, Generalized wordtype pattern for nonregular factorial designs with multiple groups of factors, Perfect minimally adaptive $q$-ary search with unreliable tests, On spectral techniques in analysis of Boolean networks, A family of complete caps in $\mathbf{PG}(n,2)$, Nonlinearity of some invariant Boolean functions, Around Pelikán's conjecture on very odd sequences, Recursive error correction for general Reed--Muller codes, On the complexity of suboptimal decoding for list and decision feedback schemes, Symmetric matrices and codes correcting rank errors beyond the $\lfloor(d-1)/2 \rfloor$ bound, Affinity of permutations of $\mathbb F_{2}^{n}$, A generalization of the binary preparata code, Information sets and partial permutation decoding for codes from finite geometries, Minimal 1-saturating sets and complete caps in binary projective spaces., Nonembeddability theorems via Fourier analysis, Higher weights for ternary and quaternary self-dual codes*, Quasi-cyclic codes from a finite affine plane, On intersection problem for perfect binary codes, Minimal blocks of binary even-weight vectors, Connection between uniformity and orthogonality for symmetrical factorial designs, Ramsey-type theorems for metric spaces with applications to online problems, Latin hypercubes and MDS codes, Detailed wordlength pattern of regular fractional factorial split-plot designs in terms of complementary sets, Vasil'ev codes of length $n=2^m$ and doubling of Steiner systems $S(n,4,3)$ of a given rank, Some orthogonal arrays with 32 runs and their projection properties, Minimum aberration blocking schemes for two- and three-level fractional factorial designs, Self-dual extended cyclic codes, Lower bounds for restricted read-once parity branching programs, A fault-tolerant one-way quantum computer, On the dual of quaternary Goethals codes and their weight hierarchies, A proof of MacWilliams' identity, The existence of a formally self-dual even [70, 35,14 code], A linear construction for certain Kerdock and Preparata codes, A fast algorithm to compute irreducible and primitive polynomials in finite fields, Error Correcting Codes in Quantum Theory, Exhaustive testing of almost all devices with outputs depending on limited number of inputs, Nonexistence of Self-Dual Normal Bases, Simulation and reversal of n -qubit Hamiltonians using Hadamard matrices, Self-dual codes over $\mathbb {Z}_{4}$ and half-integral weight modular forms, On the linear complexity of product sequences of linear recurring sequences, EXTENSIONS OF ALGEBRAIC FUNCTION FIELDS WITH COMPLETE SPLITTING OF ALL RATIONAL PLACES, GENERALIZED GEOMETRIC GOPPA CODES, FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES, Theoretical upper bounds on the covering radii of Boolean functions, Weights in codes and genus 2 curves, ON OPTIMAL QUANTUM CODES, Packing Lines, Planes, etc.: Packings in Grassmannian Spaces, Multiplying Vectors in Binary Quadratic Residue Codes, On Symmetric Representations of Finite Fields, Bounds And Constructions For Threshold Shared Generation Of Authenticators, Results on multiples of primitive polynomials and their products over GF(2), On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure, Bounds on $(n,r)$-arcs and their application to linear codes, Pieces of $2^d$\,: existence and uniqueness for Barnes-Wall and Ypsilanti lattices, On generalized Hadamard matrices of minimum rank, Some families of $\mathbb Z_4$-cyclic codes, Complete weight enumerators of generalized doubly-even self-dual codes, Cyclotomic numbers and primitive idempotents in the ring $\mathrm{GF}(q)[x/(x^{p^n} - 1)$], New extremal self-dual doubly-even binary codes of length 88, Sums of Gauss sums and weights of irreducible codes, On the weight distribution of convolutional codes, Combinatorial designs and codes over some prime fields, Fundamental groups of closed manifolds with positive curvature and torus action, How to mask the structure of codes for a cryptographic use, On linear codes over $\mathbb Z_2$, Constructions of small complete caps in binary projective spaces, Matrix characterization of linear codes with arbitrary Hamming weight hierarchy, Extensions of the critical theorem, Lifted codes and their weight enumerators, Broadcasting in unlabeled hypercubes with a linear number of messages., On a class of abstract polytopes constructed from binary codes, The asymptotic probability that a random biased matrix is invertible, Maximum distance separable codes and arcs in projective spaces, Codes from the line graphs of complete multipartite graphs and PD-sets, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Why two qubits are special, Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem, Random matrix theory over finite fields, Sharpening the Gilbert-Varshamov bound in the finite case, Explicit constructions in the classical mean squares problem in irregularities of point distribution, On the probability of undetected error for binary codes used for combined correction and detection, Another Look at Projection Properties of Hadamard Matrices, Explicit Concentrators from Generalized N-Gons, A General Product Construction for Error Correcting Codes, A Combinatorial Construction of Perfect Codes, On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests, ON THE ALGEBRAIC PARAMETERS OF CONVOLUTIONAL CODES WITH CYCLIC STRUCTURE, Extremal doubly-even self-dual codes from Hadamard matrices, Configuration distribution and designs of codes in the Johnson scheme, ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS, VALEURS IMPAIRES DE LA FONCTION DE PARTITION p(n), ON THE AUTOMORPHISM GROUPS OF A FAMILY OF BINARY QUANTUM ERROR-CORRECTING CODES, On approximately symmetric informationally complete positive operator-valued measures and related systems of quantum states, Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function, GHZ extraction yield for multipartite stabilizer states, An Inversion Formula for Krawtchcuk Polynomials with Applications to Coding Theory, A new upper bound for the minimum of an integral lattice of determinant 1, Kennzeichnung der erweiterten quadrate-codes durch ihre psl(2,q)-zulässigkeit, On Product of Read Muller Codes, THE LEE-SCHEME AND BOUNDS FOR LEE-CODES, The Geometry of m-Sequences: Three-Valued Crosscorrelations and Quadrics in Finite Projective Geometry, Weighted Averages of Radon Transforms on $Z_2^k $, On Subcodes of Generalized Second Order Reed–Muller Codes, Hamming spaces and maximal self dual codes over GF(q), q=ODD, Weight Distribution of Translates of Linear Codes and Generalized Pless Indentities, A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm, On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius, On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes, A Transform Approach to Alternant and the Like Error Correcting Codes, The Algebra of the Finite Fourier Transform and Coding Theory, A criterion for self-duality of geometric codes, Tutte Polynomials and Bicycle Dimension of Ternary Matroids, Weight Enumerators of Self-Orthogonal Codes over $GF$(3), Spreads, Translation Planes and Kerdock Sets. I, On Additive Bases and Harmonious Graphs, Robust identification and Galois sequences, The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis, The Automorphism Groups of the Kerdock Codes, Quadratic Forms and the Birman-Craggs Homomorphisms, The Moment Map of a Lie Group Representation, Functors on the Category of Finite Sets, Density doubling, double-circulants, and new sphere packings, Unnamed Item, Computational Complexity of Fourier Transforms Over Finite Fields, Weight distributions of geometric Goppa codes, Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs, On the activity of cell circuits realising the system of all conjunctions, Latroids and their representation by codes over modules, Theory of optimal blocking of nonregular factorial designs, Loop codes, On the key space of the McEliece cryptosystem based on binary Reed–Muller codes, Automorphism group of elliptic codes, Eigenvalues and the diameter of graphs, Families of curves and weight distributions of codes, Local spectra of perfect binary codes, On nonsystematic perfect binary codes of length 15, On the Walsh-Fourier analysis of Boolean functions, On Hadamard embeddability, Some generalizations of Rédei’s theorem, Unnamed Item, Approximation of Boolean functions by monomial ones, A generalisation of quadratic residue codes to the case of cubic and biquadratic residues, EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES, A note onm-weights of linear codes, CODES FOR KEY GENERATION IN QUANTUM CRYPTOGRAPHY, The covering radius of doubled 2-designs in $2O_ k$, Recognizing Schubert cells., Singleton bounds for codes over finite rings, Symmetric polynomials and some good codes, Distance-transitive graphs of valency 5, 6 and 7, Factoring polynomials over finite fields: A survey, Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes, Algebraic complexities and algebraic curves over finite fields, An application of information theory and error-correcting codes to fractional factorial experiments, Colouring Steiner quadruple systems, An upper bound for binary constant weight codes, Super-simple designs with $v\leq 32$, Ternary trades and their codes, The geometric description of a cyclic $(q- \sqrt{q}+1)$-arc in $\text{PG} (q-\sqrt{q}-3,q)$, $q$ square, The divisible code bound revisited, Gröbner bases over Galois rings with an application to decoding alternant codes, Categorical aspects of generating functions. I: Exponential formulas and Krull-Schmidt categories, Some new $p$-ary two-secure frameproof codes, Radon transforms and packings, From weight enumerators to zeta functions, The degree of functions and weights in linear codes., Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring, Algebraic structure of quasicyclic codes, Structure of $i$-components of perfect binary codes, Detection and recognition of a binary linear code, On the covering radius problem for ternary self-dual codes, A proof of the Welch and Niho conjectures on cross-correlations of binary $m$-sequences, The $[52,26,10$ binary self-dual codes with an automorphism of order 7], Nonnegative quadratic forms and bounds on orthogonal polynomials, The permutation representation of $\text{Sp}(2m,\mathbb{F}_p)$ acting on the vectors of its standard module., A mass formula for Steiner triple systems STS$(2^n-1)$ of 2-rank $2^n-n$, Algorithme de Brill-Noether et codes de Goppa, On the optimum of Delsarte's linear program, Search with small sets in presence of a liar, Subspace subcodes of generalized Reed-Solomon codes, Searching games with errors -- fifty years of coping with liars, Least adaptive optimal search with unreliable tests, Extracting all the randomness and reducing the error in Trevisan's extractors