scientific article; zbMATH DE number 7595033
From MaRDI portal
Publication:5038389
DOI10.11845/sxjz.2020063bMaRDI QIDQ5038389
Publication date: 30 September 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of error-correcting codes and error-detecting codes (94Bxx) Number theory (11-XX) Field theory and polynomials (12-XX)
Cites Work
- Unnamed Item
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- Constacyclic codes over finite fields
- A class of constacyclic codes over a finite field
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Negacyclic duadic codes
- Dual and self-dual negacyclic codes of even length over \(\mathbb Z_{2^a}\)
- Self-dual and self-orthogonal negacyclic codes of length \(2p^n\) over a finite field
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)]
- Polyadic Constacyclic Codes
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- Fundamentals of Error-Correcting Codes
- On Self-Dual Cyclic Codes Over Finite Fields
This page was built for publication:
