scientific article; zbMATH DE number 2002850
zbMATH Open1028.11072MaRDI QIDQ4435447FDOQ4435447
Authors: Zhe-Xian Wan
Publication date: 11 November 2003
Title of this publication is not available (Why is that?)
Recommendations
basesGalois ringsfinite fieldsquadratic formsirreducible polynomialsring theoryHensel's Lemmapolynomial factorisation
Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Quadratic forms over general fields (11E04) Number-theoretic algorithms; complexity (11Y16) Finite fields and commutative rings (number-theoretic aspects) (11Txx)
Cited In (only showing first 100 items - show all)
- Existence conditions for self-orthogonal negacyclic codes over finite fields
- The linear complexity of balanced quaternary sequences with optimal autocorrelation value
- Constructions on approximately mutually unbiased bases by Galois rings
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- Complete classification of \((\delta +\alpha u^2)\)-constacyclic codes over \(\mathbb {F}_{3^m}[u]/\langle u^4\rangle \) of length \(3n\)
- Constructing quasi-cyclic codes from linear algebra theory
- Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields
- A class of minimal cyclic codes over finite fields
- On the distinctness of primitive sequences over \({\mathbb Z}/(p^{e}q)\) modulo 2
- Generalized Reed-Muller codes over \({\mathbb{Z}_q}\)
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
- Generalized quasi-cyclic codes over Galois rings: structural properties and enumeration
- Title not available (Why is that?)
- Constacyclic \(\mathbb F_q\)-linear codes over \(\mathbb F_{q^l}\)
- Repeated-root constacyclic codes of length \(3 \ell^m p^s\)
- Repeated-root constacyclic codes of length \(k\ell p^s\)
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
- Cogredient standard forms of symmetric matrices over Galois rings of odd characteristic
- Repeated-root constacyclic codes of length \(n l p^s\)
- On quasi-cyclic codes over \({\mathbb{Z}_q}\)
- The weight distributions of two classes of binary cyclic codes
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
- Constacyclic codes over finite fields
- A class of minimal cyclic codes over finite fields
- The concept of \(q\)-cycle and applications
- Linear complexity of quaternary sequences of length \(pq\) with low autocorrelation
- MDS codes over finite principal ideal rings
- A new criterion on normal bases of finite field extensions
- Enumeration and construction of additive cyclic codes over Galois rings
- Some results on cyclic codes over \(\mathbb{Z}_q + u\mathbb{Z}_q\)
- Harmonic analysis on \(\text{GF}(p^{p^\infty})\). I.
- The minimum Hamming distances of irreducible cyclic codes
- Cyclic codes of odd length over \(\mathbb{Z}_4 [u]/u^k\)
- Quasi-cyclic codes of index 2 and skew polynomial rings over finite fields
- Enumeration formulas for self-dual cyclic codes
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- On self-dual cyclic codes of length \(p^a\) over \(\mathrm{GR}(p^2,s)\)
- The Gauss sums and Jacobi sums over Galois ring \(\mathrm{GR}(p^2,r)\)
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- Construction of MDS self-dual codes over Galois rings
- Orthogonal graphs of characteristic 2 and their automorphisms
- Title not available (Why is that?)
- Symmetric bilinear forms over finite fields with applications to coding theory
- Necklaces, self-reciprocal polynomials, and \(q\)-cycles
- Several Anzahl theorems of matrices over Galois rings and their applications
- Repeated root cyclic \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
- Weight distribution of preparata codes over \(Z_4\) and the construction of 3-designs
- New pseudo-planar binomials in characteristic two and related schemes
- Graphs associated with matrices over finite fields and their endomorphisms
- On least common multiples of polynomials in \(Z/n Z[x]\)
- On endomorphisms of alternating forms graph
- Boomerang uniformity of normalized permutation polynomials of low degree
- Weight distributions of cyclic codes of length \(t l^m\)
- Orthogonal graphs over Galois rings of odd characteristic
- Divisible designs, Laguerre geometry, and beyond
- Codes over rings and Hermitian lattices
- Lattice of ideals of the polynomial ring over a commutative chain ring
- Cyclic codes over \(\mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4}\)
- Composed products and factors of cyclotomic polynomials over finite fields
- Primitive idempotents in group algebras and minimal abelian codes
- Semisimple multivariable \(\mathbb {F}_q\)-linear codes over \(\mathbb {F}_{q^l}\)
- The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\)
- Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\)
- On cyclic self-orthogonal codes over \(\mathbb{Z}_{2^m}\)
- Non-unique factorization of polynomials over residue class rings of the integers
- Periods of polynomials over a Galois ring
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Explicit factorizations of cyclotomic polynomials over finite fields
- Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
- Some special cyclic codes of length \(2^n\)
- Finite fields and Galois rings
- Title not available (Why is that?)
- Counting points on diagonal equations over Galois rings \(\mathrm{GR}(p^2,2n)\)
- Subset sums over Galois rings
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- The minimum Hamming distances of the irreducible cyclic codes of length \(l_1^{m_1}l_2^{m_2} \dots l_r^{m_r}\)
- Double circulant self-dual and LCD codes over Galois rings
- New quantum codes derived from images of cyclic codes
- Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes
- An explicit expression for Euclidean self-dual cyclic codes of length \(2^k\) over Galois ring \(\mathrm{GR}(4,m)\)
- Gray images of constacyclic codes over Galois rings \(\mathcal{R}\) of nilpotency index 3
- Double circulant self-dual and LCD codes over \(\mathbb Z_{p^2}\)
- Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
- Additive codes over Galois rings
- Counting points on diagonal equations over Galois rings \(\mathrm{GR}(p^2,p^{2r})\)
- Generalized bilinear forms graphs and MRD codes over a residue class ring
- Topics in Galois Fields
- Weight distribution of double cyclic codes over Galois rings
- On polycyclic codes over a finite chain ring
- Construction of mutually unbiased maximally entangled bases through permutations of Hadamard matrices
- The images of constacyclic codes and new quantum codes
- Linear codes over \(\mathbb{F}_4R\) and their MacWilliams identity
- Bilinear forms graphs over residue class rings
- Finite fields. Understanding, calculation, application
- Galois fields and Galois rings made easy
- Endomorphisms and cores of quadratic forms graphs in odd characteristic
- Formal duality in finite abelian groups
- A mass formula for cyclic codes over Galois rings of characteristic \(p^3\)
- A class of constacyclic BCH codes
- An explicit representation and enumeration for negacyclic codes of length \(2^kn\) over \(\mathbb{Z}_4+u\mathbb{Z}_4\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435447)