scientific article; zbMATH DE number 7544432
From MaRDI portal
Publication:5082028
zbMath1497.94171MaRDI QIDQ5082028
B. Boudine, Jamal Laaouine, Mohamed El Hassani Charkani
Publication date: 20 June 2022
Full work available at URL: https://hrcak.srce.hr/clanak/399512
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Cyclic codes (94B15) Cyclotomy (11T22)
Related Items (1)
Polycyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^2 \rangle \): classification, Hamming distance, and annihilators]
Cites Work
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Explicit factorizations of cyclotomic polynomials over finite fields
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- A note on cyclic codes over \(\mathrm{GR}(p^{2},m)\) of length \(p^{k}\)
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- On the integral ideals of \(R[X\) when \(R\) is a special principal ideal ring]
- Complete classification of \((\delta + \alpha u^2)\)-constacyclic codes of length \(p^k\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} + u^2 \mathbb{F}_{p^m}\)
- Cyclic and negacyclic codes of length \(2p^s\) over \(\mathbb F_{p^m}+u\mathbb F_{p^m}\)
- ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
- Calculating cyclotomic polynomials
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Explicit constructions of cyclic and negacyclic codes of length 3ps over đ˝pm + uđ˝pm
This page was built for publication:
