Searching for "Errata for "The linear programming bound for codes over finite Frobenius rings"." – sorted by Relevance.
-
Code equivalence characterizes finite Frobenius rings, preprint
- left linear code over a finite ring R is a left submodule C ⊂ Rn . A monomial transformation f : Rn
- Cited by 1 (0 self) – Add To MetaCart
-
Errata for
- Errata for Network Flows: Theory, Algorithms, and Applications. By Ravindra K. Ahuja Thomas L
- Add To MetaCart
-
Extension Theorems for Linear Codes over Finite Rings
- Extension Theorems for Linear Codes over Finite Rings Jay A. Wood ? Department of Mathematics
- Cited by 4 (2 self) – Add To MetaCart
-
Linear codes over finite chain rings
- Linear Codes over Finite Chain Rings Thomas Honold Zentrum Mathematik Technische Universität
- Cited by 1 (0 self) – Add To MetaCart
-
Frobenius Pseudoprimes
- (x) ∈ Z[x], and n does not divide disc(f), the residue ring Z[x]/(n, f(x)) is a product of finite fields
- Cited by 3 (1 self) – Add To MetaCart
-
Duality for modules over finite rings and applications to coding theory
- DUALITY FOR MODULES OVER FINITE RINGS AND APPLICATIONS TO CODING THEORY JAY A. WOOD In memory
- Cited by 9 (3 self) – Add To MetaCart
-
Computing Frobenius Maps And Factoring Polynomials
- Abstract. A new probabilistic algorithm for factoring univariate polynomials over finite fields
- Cited by 17 (1 self) – Add To MetaCart
-
LOWER BOUNDS FOR FROBENIUS TRACES
- LOWER BOUNDS FOR FROBENIUS TRACES ENRICO BOMBIERI AND NICHOLAS M. KATZ 1. Introduction This paper
- Add To MetaCart
-
Errata
- . Windows ®, MS Windows ® and Windows NT ® are U.S. registered trademarks of Microsoft Corporation. Errata
- Add To MetaCart
-
Weight Functions and the Extension Theorem for Linear Codes over Finite Rings
- Contemporary Mathematics Weight Functions and the Extension Theorem for Linear Codes over Finite
- Cited by 7 (2 self) – Add To MetaCart

