Algebraic coding theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Twisted tensor product codes
- Periodic multisequences with large error linear complexity
- Composition of recursions and nonlinear complexity of periodic binary sequences
- Invariants of trace forms over finite fields of characteristic 2
- Error correcting sequence and projective de Bruijn graph
- Generalizing binary quadratic residue codes to higher power residues over larger fields
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- Factorization of determinants over finite fields and application in stream ciphers
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
- On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials
- Coefficients of primitive polynomials
- Periodicities of partition functions and Stirling numbers modulo p
- 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
- Discriminants and the irreducibility of a class of polynomials in a finite field of arbitrary characteristic
- A t-unidirectional error-detecting systematic code
- On the number of controllable linear systems over a finite field
- Algebraic theory of block codes detecting independent errors
- Blockwise Lee error-correcting codes
- A cryptographic system based on finite field transforms
- Bounds on the size and transmission rate of communications protocols
- Computation of a basis of symmetric functions in finite fields
- Algebraic properties of linear cellular automata
- Doubly-periodic sequences and a class of two-dimensional cyclic codes
- At the dawn of the theory of codes
- A necessary condition for the existence of perfect codes in Lie metric
- Note on cubics over GF(2ⁿ) and GF(3ⁿ)
- Some new non-Riccati algorithms for continuous-time Kalman-Bucy filtering
- The code associated with the projective plane of order four
- Polynomials with PSL(2,7) as Galois group
- Cryptology: The mathematics of secure communication
- Factorization of trinomials over Galois fields of characteristic 2
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
- Two new decoding algorithms for Reed-Solomon codes
- Weight distribution and dual distance
- An error-free Levison algorithm to solve integer Toeplitz system
- A look-ahead algorithm for the solution of general Hankel systems
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- Polynomials generating Hamming codes
- Alternating group coverings of the affine line for characteristic two
- An indexed set of density bounds on lattice packings
- Improved identification schemes based on error-correcting codes
- On the scalar rational interpolation problem
- Decoding algebraic geometry codes by a key equation
- Distribution of inverses in polynomial rings
- Generalized Gabidulin codes over fields of any characteristic
- A class of negacyclic BCH codes and its application to quantum codes
- 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]\)
- Some classes of the MDS matrices over a finite field
- On lattice-based algebraic feedback shift registers synthesis for multisequences
- Highly degenerate quadratic forms over finite fields of characteristic 2
- Power decoding Reed-Solomon codes up to the Johnson radius
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- Two varieties of finite automaton public key cryptosystem and digital signatures
- On computing the canonical form for a binary form of odd degree
- Extremal problems among subsets of a set
- The solution of equations by radicals
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain
- 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
- Linear recurring sequences over rings and modules
- Irreducible compositions of polynomials over finite fields of even characteristic
- Algebraic decoding of negacyclic codes over \({\mathbb Z_4}\)
- Constructive spherical codes near the Shannon bound
- Families of twisted tensor product codes
- New techniques for the computation of linear recurrence coefficients
- \(\sigma\)-Automata and Chebyshev-polynomials
- New results on quasi-subfield polynomials
- The ideal entropy of BCI-algebras and its application in the binary linear codes
- Linear feedback shift registers and the minimal realization problem
- Expansive automata networks
- Optimal parameters for the WG stream cipher family
- On polynomials x^n-1 over binary fields whose irreducible factors are binomials and trinomials
- Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial
- Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2
- Walsh transforms of trace forms with three or more terms and some maximal Artin-Schreier curves
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Some enumeration results on trace forms of low radical over finite fields of characteristic two
- 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
- A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u]/\langle u^2\rangle\)
- On \(\sigma \)-self-orthogonal constacyclic codes over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Properties of constacyclic codes under the Schur product
- Algorithms for simultaneous Hermite-Padé approximations
- Kötter interpolation in skew polynomial rings
- On self-dual constacyclic codes over finite fields
- Fault tolerance in distributed systems using fused state machines
- Difference equations with delay
- Solution of linear equations with Hankel and Toeplitz matrices
- Algebraic codes for network coding
- Repeated-root constacyclic codes of length k p^s
- Semidefinite programming bounds for Lee codes
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
This page was built for publication: Algebraic coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762882)
