On the public citation graph

Classical codes as ideals in group algebras

0 signed · 56 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-20712-3openalex-snapshot
Coding Theory
inferredcites →https://doi.org/10.1007/bf01072842openalex-snapshot
On the theory of group codes
inferredcites →https://doi.org/10.1007/bf01188528openalex-snapshot
Visible codes
inferredcites →https://doi.org/10.1016/s0019-9958(67)90691-2openalex-snapshot
Some results on cyclic codes which are invariant under the affine group and their applications
inferredcites →https://doi.org/10.1090/s0002-9947-1941-0004626-6openalex-snapshot
The structure of the group ring of a 𝑝-group over a modular field

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-0348-8658-1_2openalex-snapshot
Research in Representation Theory at Mainz (1984–1990)
inferred← citeshttps://doi.org/10.1007/978-3-540-87448-5_4openalex-snapshot
How to Know if a Linear Code Is a Group Code?
inferred← citeshttps://doi.org/10.1007/bf01207542openalex-snapshot
On the majority decodable distance of codes in filtrations of characteristicp>0
inferred← citeshttps://doi.org/10.1007/s000130050149openalex-snapshot
Generators and weights of polynomial codes
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/s00233-006-0647-9openalex-snapshot
An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings
inferred← citeshttps://doi.org/10.1007/s10469-012-9183-8openalex-snapshot
Ideal representation of Reed–Solomon and Reed–Muller codes
inferred← citeshttps://doi.org/10.1007/s10623-008-9261-zopenalex-snapshot
An intrinsical description of group codes
inferred← citeshttps://doi.org/10.1007/s10623-017-0437-2openalex-snapshot
On group codes with complementary duals
inferred← citeshttps://doi.org/10.1007/s10958-015-2347-zopenalex-snapshot
Basic Reed–Muller Codes as Group Codes
inferred← citeshttps://doi.org/10.1007/s13226-021-00187-5openalex-snapshot
Essential idempotents in group algebras and coding theory
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90392-1openalex-snapshot
Divisors of codes of Reed-Muller type
inferred← citeshttps://doi.org/10.1016/j.disc.2016.12.014openalex-snapshot
On monomial codes in modular group algebras
inferred← citeshttps://doi.org/10.1016/j.ins.2011.07.006openalex-snapshot
Codes based on BCK-algebras
inferred← citeshttps://doi.org/10.1016/j.laa.2010.03.002openalex-snapshot
Some constructions of linearly optimal group codes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836openalex-snapshot
Designs and their Codes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.002openalex-snapshot
Designs
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.003openalex-snapshot
Codes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.004openalex-snapshot
The geometry of vector spaces
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.005openalex-snapshot
Symmetric Designs
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.006openalex-snapshot
The standard geometric codes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.007openalex-snapshot
Codes from planes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.008openalex-snapshot
Hadamard designs
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.009openalex-snapshot
Steiner systems
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.010openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.011openalex-snapshot
Glossary
inferred← citeshttps://doi.org/10.1023/a:1008392113043openalex-snapshot
inferred← citeshttps://doi.org/10.1080/00207160.2016.1158815openalex-snapshot
Characterization of cyclic codes over {ℬ[X;(1/m)Z0]}m > 1and efficient encoding decoding algorithm for cyclic codes
inferred← citeshttps://doi.org/10.1081/agb-120028778openalex-snapshot
An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal 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/376/06948openalex-snapshot
Recent results on ring constructions for error-correcting codes
inferred← citeshttps://doi.org/10.1090/conm/826/16586openalex-snapshot
Twisted group algebras of Abelian groups: a survey
inferred← citeshttps://doi.org/10.1109/isit.1997.613439openalex-snapshot
Polynomial codes and principal ideal rings
inferred← citeshttps://doi.org/10.1109/isit.2002.1023732openalex-snapshot
Self-dual group codes
inferred← citeshttps://doi.org/10.1109/tit.2002.805076openalex-snapshot
A note on self-dual group 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.2024.3395545openalex-snapshot
Projective Essential Idempotents
inferred← citeshttps://doi.org/10.1137/0402003openalex-snapshot
Codes From Symmetry Groups, and a $[32, 17, 8]$ Code
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/s1793830912500528openalex-snapshot
CONSTRUCTION OF SELF-DUAL RADICAL 2-CODES OF GIVEN DISTANCE
inferred← citeshttps://doi.org/10.1145/258533.258575openalex-snapshot
Spectral techniques for expander codes
inferred← citeshttps://doi.org/10.12677/pm.2012.24037openalex-snapshot
Self-Dual Permutation Codes over F2+vF2
inferred← citeshttps://doi.org/10.12988/ams.2015.56443openalex-snapshot
Codes generated by R_0-algebra valued functions
inferred← citeshttps://doi.org/10.15480/882.1081openalex-snapshot
Coding theory via Groebner bases
inferred← citeshttps://doi.org/10.1556/sscmath.43.2006.1.5openalex-snapshot
On cyclic codes in incidence rings
inferred← citeshttps://doi.org/10.18273/revint.v37n1-2019008openalex-snapshot
Group algebras and coding theory: a short survey
inferred← citeshttps://doi.org/10.24275/uami.t722h892ropenalex-snapshot
Dimensión de ideales en álgebras de grupo, y códigos de grupo
inferred← citeshttps://doi.org/10.3103/s0027132213060077openalex-snapshot
Basic Reed-Muller codes and their connections with powers of radical of group algebra over a non-prime field
inferred← citeshttps://doi.org/10.36227/techrxiv.23184410openalex-snapshot
PROJECTIVE ESSENTIAL IDEMPOTENTS
inferred← citeshttps://doi.org/10.36227/techrxiv.23184410.v1openalex-snapshot
PROJECTIVE ESSENTIAL IDEMPOTENTS
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.