Polyadic codes of prime power length
From MaRDI portal
Publication:2467336
DOI10.1016/J.FFA.2006.12.006zbMATH Open1168.94009OpenAlexW2082035369MaRDI QIDQ2467336FDOQ2467336
Madhu Raka, Gurmeet K. Bakshi, Anuradha Sharma
Publication date: 21 January 2008
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2006.12.006
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polyadic Codes Revisited
- Fundamentals of Error-Correcting Codes
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
- Cyclotomy and duadic codes of prime lengths
- Duadic Codes
- Duadic codes (Corresp.)
- Coding theory
- Triadic codes
- Polyadic codes
- Split group codes
- m-adic residue codes
Cited In (16)
- Complementary dual codes for counter-measures to side-channel attacks
- Title not available (Why is that?)
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field
- On constacyclic codes over finite fields
- On cyclic and negacyclic codes of length 8ℓmpn over finite field
- Generalized residue and t-residue codes and their idempotent generators
- Structure of repeated-root constacyclic codes of length 8ℓmpn
- New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length \(2^rp^s\)
- Length Codes, Products of Languages and Primality
- Codes from dihedral 2-groups
- Polyadic Codes Revisited
- Primitive Pythagorean codes
- Polyadic constacyclic codes over a non-chain ring \(\mathbb{F}_q[u,v]/\langle f(u), g(v), uv-vu\rangle\)
- Title not available (Why is that?)
- Type-II polyadic constacyclic codes over finite fields
This page was built for publication: Polyadic codes of prime power length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467336)
