On the public citation graph
Semisimple cyclic and Abelian codes. II
0 signed · 164 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/ffta.1996.0156openalex-snapshot
Minimal Codes of Prime-Power Length
inferred← citeshttps://doi.org/10.1006/ffta.1998.0238openalex-snapshot
Minimal Cyclic Codes of Length 2pn
inferred← citeshttps://doi.org/10.1007/3-540-16767-6_49openalex-snapshot
Multivariate polynomials in coding theory
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_36openalex-snapshot
Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey)
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_56openalex-snapshot
On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime factors
inferred← citeshttps://doi.org/10.1007/978-3-0346-0286-0_10openalex-snapshot
On Some Classes of Repeated-root Constacyclic Codes of Length a Power of 2 over Galois Rings
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4openalex-snapshot
Gröbner Bases, Coding, and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_4openalex-snapshot
An Introduction to Linear and Cyclic Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_25openalex-snapshot
Symmetric LDPC Codes and Local Testing
inferred← citeshttps://doi.org/10.1007/978-3-7091-2786-5_21openalex-snapshot
Gröbner Bases and Abelian Codes
inferred← citeshttps://doi.org/10.1007/bf01068713openalex-snapshot
Combinatorial problems for binary Reed-Muller codes
inferred← citeshttps://doi.org/10.1007/bf01084252openalex-snapshot
Algebraic theory of block codes detecting independent errors
inferred← citeshttps://doi.org/10.1007/bf01089899openalex-snapshot
Representation of a group of type p? over a class of fields
inferred← citeshttps://doi.org/10.1007/s00200-020-00471-7openalex-snapshot
One-weight codes in some classes of group rings
inferred← citeshttps://doi.org/10.1007/s00200-020-00472-6openalex-snapshot
On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
inferred← citeshttps://doi.org/10.1007/s00200-021-00531-6openalex-snapshot
Quantum MDS and synchronizable codes from cyclic codes of length $$5p^s$$ over $$\mathbb F_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s00200-021-00534-3openalex-snapshot
On symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$ and MDS symbol-pair codes
inferred← citeshttps://doi.org/10.1007/s00200-022-00549-4openalex-snapshot
δ-dual codes over finite commutative semi-simple rings
inferred← citeshttps://doi.org/10.1007/s00493-014-2715-1openalex-snapshot
Symmetric LDPC codes and local testing
inferred← citeshttps://doi.org/10.1007/s100120200058openalex-snapshot
The Primitive Idempotents of a Cyclic Group Algebra
inferred← citeshttps://doi.org/10.1007/s10623-012-9735-xopenalex-snapshot
Information sets in abelian codes: defining sets and Groebner basis
inferred← citeshttps://doi.org/10.1007/s10623-018-0495-0openalex-snapshot
Primitive idempotent tables of cyclic and constacyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-020-00728-9openalex-snapshot
Two classes of optimal LRCs with information (r, t)-locality
inferred← citeshttps://doi.org/10.1007/s10773-020-04524-yopenalex-snapshot
MDS Constacyclic Codes of Prime Power Lengths Over Finite Fields and Construction of Quantum MDS Codes
inferred← citeshttps://doi.org/10.1007/s10773-021-04757-5openalex-snapshot
Quantum Codes from Repeated-Root Cyclic and Negacyclic Codes of Length 4ps Over $\mathbb {F}_{p^{m}}$
inferred← citeshttps://doi.org/10.1007/s11128-021-03306-7openalex-snapshot
Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length $$4p^s$$ over $${\mathbb {F}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s11128-023-03958-7openalex-snapshot
Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length $$3p^s$$
inferred← citeshttps://doi.org/10.1007/s11128-024-04374-1openalex-snapshot
New QEC and EAQEC codes from repeated-root cyclic codes of length $$10p^s$$ over finite fields $$\mathbb {F}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s11859-015-1051-7openalex-snapshot
Construction of repeated-root constacyclic code of length 8 p s over $F_{p^m } $
inferred← citeshttps://doi.org/10.1007/s12095-020-00450-2openalex-snapshot
Repeated-root constacyclic codes of length 2ps over $\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+u^{2}\mathbb {F}_{p^{m}}$
inferred← citeshttps://doi.org/10.1007/s12190-020-01456-yopenalex-snapshot
On Hamming and b-symbol distance distributions of repeated-root constacyclic codes of length $$4p^s$$ over $${\pmb {\mathbb {F}}}_{p^m}+u {\pmb {\mathbb {F}}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s12190-021-01695-7openalex-snapshot
Construction of optimal codes from a class of constacyclic codes
inferred← citeshttps://doi.org/10.1007/s12190-024-02127-yopenalex-snapshot
Two new classes of AMDS symbol-pair cyclic codes of length 4p
inferred← citeshttps://doi.org/10.1007/s13226-021-00187-5openalex-snapshot
Essential idempotents in group algebras and coding theory
inferred← citeshttps://doi.org/10.1007/s40314-026-03667-8openalex-snapshot
The Schur product of evaluation codes and its application to CSS-T quantum codes and private information retrieval
inferred← citeshttps://doi.org/10.1007/s40863-015-0037-xopenalex-snapshot
Minimal ideals in finite abelian group algebras and coding theory
inferred← citeshttps://doi.org/10.1007/s40863-016-0040-xopenalex-snapshot
Group algebras and coding theory
inferred← citeshttps://doi.org/10.1007/s40863-017-0074-8openalex-snapshot
Essential idempotents and codes of constant weight
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90023-4openalex-snapshot
Linear codes with given automorphism groups
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90036-2openalex-snapshot
A survey of constructive coding theory, and a table of binary codes of highest known rate
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.046openalex-snapshot
Repeated-root constacyclic codes of length ℓ p s and their duals
inferred← citeshttps://doi.org/10.1016/j.disc.2013.01.024openalex-snapshot
Structure of repeated-root constacyclic codes of length 3ps and their duals
inferred← citeshttps://doi.org/10.1016/j.disc.2014.05.007openalex-snapshot
Some minimal cyclic codes over finite fields
inferred← citeshttps://doi.org/10.1016/j.disc.2016.01.020openalex-snapshot
Repeated-root constacyclic codes of prime power length over F p m [ u ] 〈 u a 〉 and their duals
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.014openalex-snapshot
On constacyclic codes of length 4ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.044openalex-snapshot
On self-dual constacyclic codes of length ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.disc.2017.12.019openalex-snapshot
Negacyclic codes of length 4ps over Fpm+uFpm and their duals
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112856openalex-snapshot
Duality of constacyclic codes of prime power length over the finite non-commutative chain ring Fpm[u,θ]〈u2〉
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113593openalex-snapshot
On Hamming distance distributions of repeated-root constacyclic codes of length 3p over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2004.01.005openalex-snapshot
Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(xpn−1)
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.09.007openalex-snapshot
Idempotents in group algebras and minimal abelian codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.07.003openalex-snapshot
Repeated-root constacyclic codes of length 2ps
inferred← citeshttps://doi.org/10.1016/j.ffa.2012.09.004openalex-snapshot
Explicit determination of certain minimal constabelian codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.09.003openalex-snapshot
Negacyclic codes of length 2ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.11.006openalex-snapshot
Repeated-root constacyclic codes of length 2 ℓ m p n
inferred← citeshttps://doi.org/10.1016/j.ffa.2015.09.006openalex-snapshot
Constacyclic codes of length 2p over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.07.011openalex-snapshot
Repeated-root constacyclic codes of prime power lengths over finite chain rings
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.09.004openalex-snapshot
On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.10.006openalex-snapshot
All α+uβ-constacyclic codes of length np over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.07.001openalex-snapshot
Semisimple finite group algebra of a generalized strongly monomial group
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2010.05.027openalex-snapshot
Constacyclic codes of length p s over F p m + u F p m
inferred← citeshttps://doi.org/10.1080/00927872.2020.1754424openalex-snapshot
On idempotents of a class of commutative rings
inferred← citeshttps://doi.org/10.1088/1742-6596/1160/1/012012openalex-snapshot
Implementation of an algorithm to compute the strong apparent distance of bivariate codes
inferred← citeshttps://doi.org/10.1090/conm/093openalex-snapshot
Representation Theory, Group Rings, and Coding Theory
inferred← citeshttps://doi.org/10.1090/conm/609/12150openalex-snapshot
Repeated-Root Cyclic and Negacyclic Codes of Length 6𝑝^{𝑠}
inferred← citeshttps://doi.org/10.1090/conm/634/12692openalex-snapshot
Open Problems in Coding Theory
inferred← citeshttps://doi.org/10.1090/conm/642/12886openalex-snapshot
Equivalence Classes and Structures of Constacyclic Codes Over Finite Fields
inferred← citeshttps://doi.org/10.1090/conm/642/12887openalex-snapshot
On Repeated-Root Constacyclic Codes of Prime Power Length Over Polynomial Residue Rings
inferred← citeshttps://doi.org/10.1090/conm/826/16586openalex-snapshot
Twisted group algebras of Abelian groups: a survey
inferred← citeshttps://doi.org/10.1109/18.135637openalex-snapshot
Cyclic concatenated codes with constacyclic outer codes
inferred← citeshttps://doi.org/10.1109/18.165458openalex-snapshot
Transform domain characterization of abelian codes
inferred← citeshttps://doi.org/10.1109/18.272482openalex-snapshot
The n-dimensional key equation and a decoding application
inferred← citeshttps://doi.org/10.1109/18.340486openalex-snapshot
A generalized DFT for Abelian codes over Z/sub m/
inferred← citeshttps://doi.org/10.1109/18.86974openalex-snapshot
Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
inferred← citeshttps://doi.org/10.1109/18.904535openalex-snapshot
On a family of Abelian codes and their state complexities
inferred← citeshttps://doi.org/10.1109/access.2020.2981453openalex-snapshot
Explicit Representation and Enumeration of Repeated-Root (δ + αu²)-Constacyclic Codes Over F₂ m [u]/‹u 2λ›
inferred← citeshttps://doi.org/10.1109/access.2020.3006001openalex-snapshot
Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2ps Over F pm
inferred← citeshttps://doi.org/10.1109/access.2021.3117561openalex-snapshot
Some Classes of New Quantum MDS and Synchronizable Codes Constructed From Repeated-Root Cyclic Codes of Length 6ps
inferred← citeshttps://doi.org/10.1109/access.2021.3117569openalex-snapshot
MDS Constacyclic Codes and MDS Symbol-Pair Constacyclic Codes
inferred← citeshttps://doi.org/10.1109/access.2022.3219498openalex-snapshot
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m
inferred← citeshttps://doi.org/10.1109/access.2023.3245520openalex-snapshot
On Symbol-Triple Distance of a Class of Constacyclic Codes of Length 3ps Over F pm + uF pm
inferred← citeshttps://doi.org/10.1109/access.2025.3590462openalex-snapshot
A Family of Almost MDS Symbol-Pair Codes of Length 8p
inferred← citeshttps://doi.org/10.1109/cig.2010.5592836openalex-snapshot
Information sets for abelian codes
inferred← citeshttps://doi.org/10.1109/isit.2012.6284011openalex-snapshot
Partial permutation decoding for abelian codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517898openalex-snapshot
Permute & Add Network Codes via Group Algebras
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834598openalex-snapshot
Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206639openalex-snapshot
t-PIR Schemes with Flexible Parameters via Star Products of Berman Codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619225openalex-snapshot
Recursive Subproduct Codes with Reed-Muller-like Structure
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653705openalex-snapshot
On Decoding First-and Second-Order BiD Codes
inferred← citeshttps://doi.org/10.1109/itw.2011.6089383openalex-snapshot
Minimal codes in binary abelian group algebras
inferred← citeshttps://doi.org/10.1109/itw.2013.6691285openalex-snapshot
Computing the Camion's multivariate BCH bound
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240261openalex-snapshot
BiD Codes: Algebraic Codes from 3 × 3 Kernel
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2868637openalex-snapshot
Hamming and Symbol-Pair Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over $\mathbb F_{p^m}+u\mathbb F_{p^m}$
inferred← citeshttps://doi.org/10.1109/ncc55593.2022.9806780openalex-snapshot
A Family of Capacity-Achieving Abelian Codes for the Binary Erasure Channel
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238186openalex-snapshot
Locally testable cyclic codes
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3158369openalex-snapshot
Permute and Add Network Codes via Group Algebras
inferred← citeshttps://doi.org/10.1109/tit.1972.1054923openalex-snapshot
Survey of Soviet research in information theory
inferred← citeshttps://doi.org/10.1109/tit.1978.1055964openalex-snapshot
General theory of doubly periodic arrays over an arbitrary finite field and its applications
inferred← citeshttps://doi.org/10.1109/tit.1981.1056396openalex-snapshot
On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
inferred← citeshttps://doi.org/10.1109/tit.1985.1057109openalex-snapshot
The concatenated structure of cyclic and Abelian codes
inferred← citeshttps://doi.org/10.1109/tit.2002.800475openalex-snapshot
Quasi-cyclic dyadic codes in the Walsh-Hadamard transform domain
inferred← citeshttps://doi.org/10.1109/tit.2003.815816openalex-snapshot
Abelian codes over galois rings closed under certain permutations
inferred← citeshttps://doi.org/10.1109/tit.2005.851735openalex-snapshot
Locally Testable Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.862123openalex-snapshot
Is the class of cyclic codes asymptotically good?
inferred← citeshttps://doi.org/10.1109/tit.2009.2013015openalex-snapshot
Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
inferred← citeshttps://doi.org/10.1109/tit.2011.2163492openalex-snapshot
Information Sets From Defining Sets in Abelian Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2236383openalex-snapshot
Abelian Codes in Principal Ideal Group Algebras
inferred← citeshttps://doi.org/10.1109/tit.2013.2259141openalex-snapshot
Partial Permutation Decoding for Abelian Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2284211openalex-snapshot
$G$-Equivalence in Group Algebras and Minimal Abelian Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2512594openalex-snapshot
Apparent Distance and a Notion of BCH Multivariate Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2726691openalex-snapshot
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
inferred← citeshttps://doi.org/10.1109/tit.2017.2742499openalex-snapshot
Two New Families of Two-Weight Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2906301openalex-snapshot
The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle
inferred← citeshttps://doi.org/10.1109/tit.2019.2923758openalex-snapshot
LCD and Self-Orthogonal Group Codes in a Finite Abelian $p$ -Group Algebra
inferred← citeshttps://doi.org/10.1109/tit.2019.2941885openalex-snapshot
MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
inferred← citeshttps://doi.org/10.1109/tit.2021.3066008openalex-snapshot
On Cyclic Codes of Composite Length and the Minimum Distance II
inferred← citeshttps://doi.org/10.1109/tit.2022.3222474openalex-snapshot
Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs
inferred← citeshttps://doi.org/10.1109/tit.2023.3299287openalex-snapshot
Berman Codes: A Generalization of Reed–Muller Codes That Achieve BEC Capacity
inferred← citeshttps://doi.org/10.1134/s0032946015030023openalex-snapshot
Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
inferred← citeshttps://doi.org/10.1134/s0032946024030025openalex-snapshot
On Additive Quasi-abelian Codes over Finite Fields and Their Duality Properties
inferred← citeshttps://doi.org/10.1137/0402003openalex-snapshot
Codes From Symmetry Groups, and a $[32, 17, 8]$ Code
inferred← citeshttps://doi.org/10.1142/s0219498820502096openalex-snapshot
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
inferred← citeshttps://doi.org/10.1142/s0219498823502225openalex-snapshot
On the algebraic structure of quasi-group codes
inferred← citeshttps://doi.org/10.1142/s1793557112500027openalex-snapshot
EXPLICIT DETERMINATION OF CERTAIN MINIMAL ABELIAN CODES AND THEIR MINIMUM DISTANCES
inferred← citeshttps://doi.org/10.1142/s1793557112500167openalex-snapshot
A NOTE ON CONSTABELIAN CODES
inferred← citeshttps://doi.org/10.1142/s1793557113500204openalex-snapshot
ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
inferred← citeshttps://doi.org/10.1142/s1793557124501006openalex-snapshot
On a class of constacyclic codes and MDS code construction over 𝔽pm[u,v] 〈u2−δu,v2−γv,uv−vu〉
inferred← citeshttps://doi.org/10.1142/s179383092550065xopenalex-snapshot
Repeated-root constacyclic codes of length 3ps over the finite non-chain ring 𝔽pm[u,v] 〈u2,v2,uv−vu〉 and their duals
inferred← citeshttps://doi.org/10.1155/2016/3965789openalex-snapshot
Skew Constacyclic Codes over Finite Fields and Finite Chain Rings
inferred← citeshttps://doi.org/10.13069/jacodesmath.09585openalex-snapshot
One–generator quasi–abelian codes revisited
inferred← citeshttps://doi.org/10.13069/jacodesmath.284931openalex-snapshot
Essential idempotents and simplex codes
inferred← citeshttps://doi.org/10.13069/jacodesmath.36866openalex-snapshot
Recent progress on weight distributions of cyclic codes over finite fields
inferred← citeshttps://doi.org/10.18273/revint.v37n1-2019008openalex-snapshot
Group algebras and coding theory: a short survey
inferred← citeshttps://doi.org/10.2298/fil2312985kopenalex-snapshot
Duadic codes over Fp + uFp + vFp + uvFp
inferred← citeshttps://doi.org/10.2298/fil2433889dopenalex-snapshot
AMDS constacyclic codes and quantum AMDS codes
inferred← citeshttps://doi.org/10.3390/axioms10040303openalex-snapshot
Constacyclic Codes over Finite Chain Rings of Characteristic p
inferred← citeshttps://doi.org/10.3390/axioms12030254openalex-snapshot
On Symbol-Pair Distance of a Class of Constacyclic Codes of Length 3ps over Fpm+uFpm
inferred← citeshttps://doi.org/10.3390/axioms13100655openalex-snapshot
γ-Dual Codes over Finite Commutative Chain Rings
inferred← citeshttps://doi.org/10.3390/sym17030428openalex-snapshot
Hamming and Symbol-Pair Distances of Constacyclic Codes of Length 2ps over Fpm[u,v]⟨u2,v2,uv−vu⟩
inferred← citeshttps://doi.org/10.3906/mat-2006-102openalex-snapshot
On the number of non-G-equivalent minimal abelian codes
inferred← citeshttps://doi.org/10.3934/amc.2012.6.175openalex-snapshot
On some classes of constacyclic codes over polynomial residue rings
inferred← citeshttps://doi.org/10.3934/amc.2019019openalex-snapshot
Some new constructions of isodual and LCD codes over finite fields
inferred← citeshttps://doi.org/10.3934/amc.2020123openalex-snapshot
Constacyclic codes of length $ 8p^s $ over $ \mathbb F_{p^m} + u\mathbb F_{p^m} $
inferred← citeshttps://doi.org/10.3934/amc.2020135openalex-snapshot
Duadic codes over $ \mathbb{Z}_4+u\mathbb{Z}_4 $
inferred← citeshttps://doi.org/10.3934/amc.2023051openalex-snapshot
On the structure of the linear codes with a given automorphism
inferred← citeshttps://doi.org/10.4171/lem/63-3/4-4openalex-snapshot
Good cyclic codes and the uncertainty principle
inferred← citeshttps://doi.org/10.48550/arxiv.1101.1803openalex-snapshot
Information sets from defining sets in abelian codes
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2960openalex-snapshot
Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1412.8042openalex-snapshot
Group Algebra and Coding Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00356openalex-snapshot
On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields
inferred← citeshttps://doi.org/10.48550/arxiv.1612.03731openalex-snapshot
A Note on Hamming distance of constacyclic codes of length $p^s$ over $\mathbb F_{p^m} + u\mathbb F_{p^m}$
inferred← citeshttps://doi.org/10.48550/arxiv.1705.09859openalex-snapshot
On shortened and punctured cyclic codes
inferred← citeshttps://doi.org/10.48550/arxiv.2002.06407openalex-snapshot
On the dimension of ideals in group algebras, and group codes
inferred← citeshttps://doi.org/10.55730/1300-0098.3296openalex-snapshot
A characterization of abelian group codes in terms of their parameters
inferred← citeshttps://doi.org/10.56824/vujs.2019nt40openalex-snapshot
Algebraic structure of cyclic and negacyclic codes over a finite chain ring alphabet and applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.