Algebraic coding theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Two new decoding algorithms for Reed-Solomon codes
- An error-free Levison algorithm to solve integer Toeplitz system
- Displacement structure for Hankel, Vandermonde, and related (derived) matrices
- Highly degenerate quadratic forms over \(\mathbb F_{2}\)
- Good codes based on very sparse matrices
- The code associated with the projective plane of order four
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
- An analog of the prime number theorem for finite fields via truncated polylogarithm expansions
- A note on the weight distribution of minimal constacyclic codes
- Stable factorization for Hankel and Hankel‐like matrices
- On Hamming distance and RT distance of a class of constacyclic codes over \(\mathbb{F}_{p^n}+u\mathbb{F}_{p^n}+\cdots +u^{t-1}\mathbb{F}_{p^n}\)
- Galois Rings and Pseudo-random Sequences
- On counting absolute trace of powers inGF(p m )
- Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
- Quantum and LCD codes from skew constacyclic codes over a finite non-chain ring
- 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
- Distribution of inverses in polynomial rings
- Reducing the number of qubits in quantum information set decoding
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
- Factorization of composed polynomials and applications
- scientific article; zbMATH DE number 4047170 (Why is no real title available?)
- Improved identification schemes based on error-correcting codes
- On \(\sigma \)-self-orthogonal constacyclic codes over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- The dual codes of negacyclic BCH codes of length \(\frac{q^m+1}{2}\)
- Weight Enumeration and the Geometry of Linear Codes
- Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
- scientific article; zbMATH DE number 3822792 (Why is no real title available?)
- scientific article; zbMATH DE number 4097511 (Why is no real title available?)
- Advanced Berlekamp-Massey method as a basis for finding periodicities in bitstreams
- Walsh transforms of trace forms with three or more terms and some maximal Artin-Schreier curves
- Discriminants and the irreducibility of a class of polynomials in a finite field of arbitrary characteristic
- 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
- Good self dual codes exist
- A necessary condition for the existence of perfect codes in Lie metric
- On symbol-pair distance distributions of repeated-root constacyclic codes of length 4p^s and MDS codes
- A new path to code-based signatures via identification schemes with restricted errors
- The ideal entropy of BCI-algebras and its application in the binary linear codes
- Expansive automata networks
- Optimal parameters for the WG stream cipher family
- scientific article; zbMATH DE number 45703 (Why is no real title available?)
- Factorization of a class of composed polynomials
- Towards a Gröbner-free approach to coding
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- The performance of concatenated schemes based on non-binary multithreshold decoders
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- A t-unidirectional error-detecting systematic code
- Serial concatenation of Hermitian codes with ring-TCM codes
- The analog of the Erdös distance problem in finite fields
- An improvement to the Minkowski‐Hiawka bound for packing superballs
- Linear codes invariant under cyclic endomorphisms
- On the vector subspaces of \(\mathbb{F}_{2^n}\) over which the multiplicative inverse function sums to zero
- Equal-degree factorization of binomials and trinomials over finite fields
- Repeated-root constacyclic codes of length k p^s
- Self-dual and self-orthogonal negacyclic codes of length 2ᵐ p^n over a finite field
- On the number of controllable linear systems over a finite field
- Extended Varshamov-Gilbert-Sacks bound for linear Lee weight codes
- Some results on counting roots of polynomials and the Sylvester resultant
- Generalized cyclotomic numbers and cyclic codes of prime power length over \(\mathbb Z_4\)
- Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme
- At the dawn of the theory of codes
- BCH codes with minimum distance proportional to code length
- Analysis of Rabin's irreducibility test for polynomials over finite fields
- Computing Frobenius maps and factoring polynomials
- The Berlekamp-Massey algorithm revisited
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- Linear recurring sequences over modules
- Quantum and LCD codes from skew constacyclic codes over a general class of non-chain rings
- Families of \(p\)-ary sequences with low correlation and large linear complexity
- Factoring Polynomials Over Large Finite Fields
- Some new results on the conjecture on exceptional APN functions and absolutely irreducible polynomials: the Gold case
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
- Repeated-root constacyclic codes of length \(6l^mp^n\)
- Decoding algorithm as a moment problem related to the extended Lotka–Volterra system
- An indexed set of density bounds on lattice packings
- Note on cubics over GF(2ⁿ) and GF(3ⁿ)
- Algebraic theory of block codes detecting independent errors
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- \(\sigma\)-Automata and Chebyshev-polynomials
- Cyclic and negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On cyclic and negacyclic codes of length \(8p^s\) over \(\mathbb F_{p^m} + u \mathbb F_{p^m}\)
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Determining the k-error joint linear complexity spectrum for a binary multisequence with period p^n
- On constacyclic codes over finite fields
- An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem
- Semidefinite programming bounds for Lee codes
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent
- On Polynomial Factorization Over Finite Fields
- A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
- A STUDY OF SKEW CONSTACYCLIC CODES OVER
- 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
- Blockwise Lee error-correcting codes
- Linear codes invariant under a linear endomorphism
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)
