Using cyclic (f, )-codes over finite chain rings to construct Z_p- and F_q[\![t]\!]-lattices

DOI10.1007/S10623-026-01933-8MaRDI QIDQ7345676zbMATH OpenFDO

Authors Susanne Pumplün

Publication date 10 September 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-026-01933-8

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) General nonassociative rings (17A99) Linear codes (general theory) (94B05) Arithmetic codes (94B40)

Cites work

• (, )-codes
• A parametrization of nonassociative cyclic algebras of prime degree
• An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials.
• Basic module theory over non-commutative rings with computational aspects of operator algebras
• Coding and Cryptography
• Division algebras and MRD codes from skew polynomials
• Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes
• Finite-Dimensional Division Algebras over Fields
• Free cyclic codes as invariant submodules over finite chain rings
• Generalized Gabidulin codes over fields of any characteristic
• How to obtain lattices from (f,,)-codes via a generalization of construction A
• scientific article; zbMATH DE number 611919 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 798609 (Why is no real title available?)
• scientific article; zbMATH DE number 3323088 (Why is no real title available?)
• Ideals over a non-commutative ring and their application in cryptology
• Iterated Space-Time Code Constructions From Cyclic Algebras
• LCD codes over finite chain rings
• Learning with errors from nonassociative algebras
• Linear codes using skew polynomials with automorphisms and derivations
• Maximal orders in nonassociative quaternion algebras
• Maximum-rank array codes and their application to crisscross error correction
• Non-commutative ring learning with errors from cyclic algebras
• Nonassociative cyclic algebras
• Norm orthogonal bases and invariants of p-adic lattices
• On constacyclic codes over finite chain rings
• On isometry and equivalence of constacyclic codes over finite chain rings
• On skew polynomial codes and lattices from quotients of cyclic division algebras
• On some computational problems in local fields
• Public-key cryptosystems and signature schemes from \(p\)-adic lattices
• Quotients of orders in cyclic algebras and space-time codes
• Rank-metric codes and their applications
• Skew quasi-cyclic codes over Galois rings
• Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
• The nonassociative algebras used to build fast-decodable space-time block codes
• Theory of non-commutative polynomials

This page was built for publication: Using cyclic \((f,\sigma )\)-codes over finite chain rings to construct \(\mathbb{Z}_p\)- and \(\mathbb{F}_q[\![t]\!]\)-lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345676)