scientific article

zbMath0988.94521MaRDI QIDQ2762882

Elwyn R. Berlekamp

Publication date: 13 January 2002

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

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Theory of error-correcting codes and error-detecting codes (94Bxx)

Related Items

A parallel Viterbi decoding algorithm, The file distribution problem for processor networks, A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377, Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m), On cyclic and negacyclic codes of length 8ℓmpn over finite field, Stable factorization for Hankel and Hankel‐like matrices, A Decoding Approach to Reed–Solomon Codes from Their Definition, Refined convergents to the associated continued fractions for binary sequences, Periods Distribution in the Linear Feedback Generalized Registers, Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm, On the hardness of the Lee syndrome decoding problem, An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem, The analog of the Erdös distance problem in finite fields, Two families of negacyclic BCH codes, A STUDY OF SKEW CONSTACYCLIC CODES OVER, Towards a Gröbner-free approach to coding, Quantum and LCD codes from skew constacyclic codes over a finite non-chain ring, Repeated-root constacyclic codes of length \(6l^mp^n\), On restricted partitions of numbers, An analog of the prime number theorem for finite fields via truncated polylogarithm expansions, Characterization of irreducible polynomials over a special principal ideal ring, Minimum vertex cover, distributed decision-making, and communication complexity, Sphere packings constructed from BCH and Justesen codes, On Bivariate Polynomial Factorization over Finite Fields, Some decoding applications of minimal realization, Good codes based on very sparse matrices, Une famille infinie de formes quadratiques entières; leurs groupes d'automorphismes, On Cyclic and Negacyclic Codes of Length 8p^s Over Fp^m + uFp^m, Algebraic aspects of B-regular series, On a Diophantine Equation Related to Perfect Codes, Finding smooth integers in short intervals using CRT decoding, BCH Codes with Minimum Distance Proportional to Code Length, Irreducible trinomials over finite fields, ON LIST DECODING OF WAVELET CODES OVER FINITE FIELDS OF CHARACTERISTIC TWO, Factoring Polynomials Over Large Finite Fields, Linear cellular automata and recurring sequences in finite fields, On subspaces contained in subsets of finite homogeneous spaces, Some results on counting roots of polynomials and the Sylvester resultant, New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent, Generalized cyclotomic numbers and cyclic codes of prime power length over Z4, Galois Rings and Pseudo-random Sequences, Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences, Randomness and Representation of Span n Sequences, On Recognition of Shift Registers, Structure of repeated-root constacyclic codes of length 8ℓmpn, Linear cellular automata and recurring sequences in finite fields, Fast parallel algorithms for polynomial division over an arbitrary field of constants, The reducibility theorem for linearised polynomials over finite fields, On the relation between BDDs and FDDs, Density doubling, double-circulants, and new sphere packings, Sharply triply transitive projective permutation groups and nonbinary codes generated by them, A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2), Decoding algorithm as a moment problem related to the extended Lotka–Volterra system, Primitive Binary Polynomials, A look-ahead algorithm for the solution of general Hankel systems, Coefficients of primitive polynomials, The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization, Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\), Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\), Polynomials generating Hamming codes, Periodicities of partition functions and Stirling numbers modulo \(p\), Alternating group coverings of the affine line for characteristic two, Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\), On constacyclic codes over finite fields, An indexed set of density bounds on lattice packings, The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain, Improved identification schemes based on error-correcting codes, A VLSI architecture for performing finite field arithmetic with reduced table lookup, 2-dimensional arithmetic residue check codes, A note on the computation of the bit error rate for binary block codes, On the scalar rational interpolation problem, Discriminants and the irreducibility of a class of polynomials in a finite field of arbitrary characteristic, Generalized Gabidulin codes over fields of any characteristic, Linear recurring sequences over modules, Linear recurring sequences over Galois rings, Are fifth-degree equations over \(GF(5^ m)\) solvable by radicals?, Mathematical problems in cryptology, A t-unidirectional error-detecting systematic code, Linear recurring sequences over rings and modules, A class of negacyclic BCH codes and its application to quantum codes, On the number of controllable linear systems over a finite field, The second coordinate sequence of a linear recurrence of maximal period over a nontrivial Galois ring of odd characteristic, Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)], Algebraic theory of block codes detecting independent errors, Irreducible compositions of polynomials over finite fields of even characteristic, Some classes of the MDS matrices over a finite field, Linearized polynomial maps over finite fields, Algebraic decoding of negacyclic codes over \({\mathbb Z_4}\), Constructive spherical codes near the Shannon bound, Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes, Blockwise Lee error-correcting codes, A cryptographic system based on finite field transforms, On lattice-based algebraic feedback shift registers synthesis for multisequences, Families of twisted tensor product codes, Factoring polynomials modulo special primes, An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs, Bounds on the size and transmission rate of communications protocols, Computation of a basis of symmetric functions in finite fields, Association schemes related to Delsarte-Goethals codes, Algebraic properties of linear cellular automata, A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions, Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field, FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\), Construction of binary minimal product parity-check matrices, On sequences, rational functions and decomposition, Practical constructive schemes for deterministic shared-memory access, Doubly-periodic sequences and a class of two-dimensional cyclic codes, Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes, Expansion complexity and linear complexity of sequences over finite fields, An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings, On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\), At the dawn of the theory of codes, On the structure of order domains, A necessary condition for the existence of perfect codes in Lie metric, Note on cubics over \(GF(2^n)\) and \(GF(3^n)\), Highly degenerate quadratic forms over finite fields of characteristic 2, Some new non-Riccati algorithms for continuous-time Kalman-Bucy filtering, Power decoding Reed-Solomon codes up to the Johnson radius, The code associated with the projective plane of order four, Incomplete sums, DC-constrained codes, and codes that maintain synchronization, Polynomials with PSL(2,7) as Galois group, Twisted tensor product codes, Periodic multisequences with large error linear complexity, Composition of recursions and nonlinear complexity of periodic binary sequences, Cryptology: The mathematics of secure communication, Invariants of trace forms over finite fields of characteristic 2, Error correcting sequence and projective de Bruijn graph, Weight distribution of translates of MDS codes, Generalizing binary quadratic residue codes to higher power residues over larger fields, Factorization of trinomials over Galois fields of characteristic 2, Windmill polynomials over fields of characteristic two, On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field, Two varieties of finite automaton public key cryptosystem and digital signatures, Factorization of determinants over finite fields and application in stream ciphers, On computing the canonical form for a binary form of odd degree, A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I, HELP: a sparse error locator polynomial for BCH codes, Computer algebra tales on Goppa codes and McEliece cryptography, Power error locating pairs, Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\), Extremal problems among subsets of a set, The solution of equations by radicals, Decoding algebraic geometry codes by a key equation, Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N, On the discriminant of a trinomial, Two new decoding algorithms for Reed-Solomon codes, Displacement structure for Hankel, Vandermonde, and related (derived) matrices, Distribution of inverses in polynomial rings, Recursive partial realization for 2-D data arrays, Weight distribution and dual distance, On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials, Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics., An error-free Levison algorithm to solve integer Toeplitz system, A note on the weight distribution of minimal constacyclic codes, Obtaining Specified Irreducible Polynomials over Finite Fields, Random Colorings of a Lattice of Squares in the Plane, Some enumeration results on trace forms of low radical over finite fields of characteristic two, Computing Frobenius maps and factoring polynomials, Further improvements on asymptotic bounds for codes using distinguished divisors, Unnamed Item, A New Algorithm for Decoding Reed-Solomon Codes, Linear Complexity of Periodic Sequences: A General Theory, RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\), A generalization of multi-twisted codes over finite fields, their Galois duals and type II codes, Multi-twisted additive codes over finite fields, Unnamed Item, On the evaluation codes given by simple \(\delta \)-sequences, A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u/\langle u^2\rangle\)], Computing the structure of finite algebras, A Method to Compute Minimal Polynomials, On \(\sigma \)-self-orthogonal constacyclic codes over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\), Some new results on the conjecture on exceptional APN functions and absolutely irreducible polynomials: the Gold case, Recovering highly-complex linear recurrences of integer sequences, Unnamed Item, An improvement to the Minkowski‐Hiawka bound for packing superballs, Constructive packings of cross polytopes, Factorisation sur $\mathbb {Z}[X$ des polynômes de degré élevé à l’aide d’un monomorphisme], Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields, A new random number generator from permutation groups, Properties of constacyclic codes under the Schur product, On Polynomial Factorization Over Finite Fields, A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity, Unnamed Item, Primitive idempotent tables of cyclic and constacyclic codes, The Performance of Concatenated Schemes Based on Non-binary Multithreshold Decoders, Groupes de permutations des codes mds affine-invariants, Some negacyclic BCH codes and quantum codes, Factorization of a class of composed polynomials, Poids et équivalence des codes linéaires, A family of Hermitian dual-containing constacyclic codes and related quantum codes, Algorithms for simultaneous Hermite-Padé approximations, A fraction free matrix Berlekamp/Massey algorithm, Evaluation codes defined by finite families of plane valuations at infinity, Fast skew-feedback shift-register synthesis, Optimal control for non-polynomial systems, On the cogirth of binary matroids, An improved method for predicting truncated multiple recursive generators with unknown parameters, \((d, \boldsymbol{\sigma})\)-Veronese variety and some applications, Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability, New techniques for the computation of linear recurrence coefficients, On counting absolute trace of powers inGF(p m ), \(\sigma\)-Automata and Chebyshev-polynomials, New results on quasi-subfield polynomials, Unnamed Item, Weight Enumeration and the Geometry of Linear Codes, Highly degenerate quadratic forms over \(\mathbb F_{2}\), Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials, Computing Logarithms in Finite Fields of Characteristic Two, Kötter interpolation in skew polynomial rings, Inverse scattering and minimal partial realizations, The ideal entropy of BCI-algebras and its application in the binary linear codes, The generalized Goertzel algorithm and its parallel hardware implementation, Linear feedback shift registers and the minimal realization problem, On self-dual constacyclic codes over finite fields, Expansive automata networks, Fault tolerance in distributed systems using fused state machines, Difference equations with delay, Solution of linear equations with Hankel and Toeplitz matrices, Analysis of Rabin's irreducibility test for polynomials over finite fields, Optimal parameters for the WG stream cipher family, Indecomposable local maps of tessellation automata, Extremal problems among subsets of a set. (Reprint), Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators, The Berlekamp-Massey algorithm revisited, On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials, Trace forms over finite fields of characteristic 2 with prescribed invariants, Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y\)], Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial, On the Golay perfect binary code, Repeated-root constacyclic codes of length \(k\ell p^s\), Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2, IRREGULARLY DECIMATED CHAOTIC MAP(S) FOR BINARY DIGITS GENERATIONS, Semidefinite programming bounds for Lee codes, On the Mathieu groups \(M_ 22, M_ 23, M_ 24\) and the uniqueness of the assoiated Steiner system, Unconventional construction of DNA codes: Group Homomorphism, Simplified High-Speed High-Distance List Decoding for Alternant Codes, Euler products, cyclotomy, and coding, Serial concatenation of Hermitian codes with ring-TCM codes, Good self dual codes exist, Walsh transforms of trace forms with three or more terms and some maximal Artin-Schreier curves, On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes, Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight, Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting, Skew multi-twisted codes over finite fields and their Galois duals, Factorization of composed polynomials and applications, Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\), Factoring with Cyclotomic Polynomials, On a family of pseudorandom binary sequences, THE LEE-SCHEME AND BOUNDS FOR LEE-CODES, Generalized residue and t-residue codes and their idempotent generators, Families of \(p\)-ary sequences with low correlation and large linear complexity, Polynomial factorization over ${\mathbb F}_2$, Extended Varshamov-Gilbert-Sacks Bound for Linear Lee Weight Codes, Computational Complexity of Fourier Transforms Over Finite Fields