scientific article

Publication date: 13 January 2002

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

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 (only showing first 100 items - show all)

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

This page was built for publication: