✦ LIBER ✦

Code equivalence characterizes finite Frobenius rings

✍ Scribed by Wood, Jay A.

Book ID: 125539548
Publisher: American Mathematical Society
Year: 2007
Tongue: English
Weight: 150 KB
Volume: 136
Category: Article
ISSN: 0002-9939
DOI: 10.1090/S0002-9939-07-09164-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of finite Frobenius rin

Characterization of finite Frobenius rings

✍ T. Honold 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 140 KB

Demi-matroids from codes over finite Fro

Demi-matroids from codes over finite Frobenius rings

✍ Britz, Thomas; Shiromoto, Keisuke; Westerbäck, Thomas 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 197 KB

Matrix product codes over finite commuta

Matrix product codes over finite commutative Frobenius rings

✍ Fan, Yun; Ling, San; Liu, Hongwei 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 334 KB

Orthogonality Matrices for Modules over

Orthogonality Matrices for Modules over Finite Frobenius Rings and MacWilliams' Equivalence Theorem

✍ Marcus Greferath 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 106 KB

MacWilliams' equivalence theorem states that Hamming isometries between linear codes extend to monomial transformations of the ambient space. One of the most elegant proofs for this result is due to K. P. Bogart et al. (1978, Inform. and Control 37, 19-22) where the invertibility of orthogonality ma

A Griesmer Bound for Codes over Finite Q

A Griesmer Bound for Codes over Finite Quasi-Frobenius Rings

✍ Keisuke Shiromoto; Leo Storme 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 538 KB

On the Equivalence of Codes over Finite

On the Equivalence of Codes over Finite Rings

✍ Hai Quang Dinh; Sergio R. López-Permouth 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 148 KB