A note on the Singleton bounds for codes over finite rings
classification
💻 cs.IT
math.IT
keywords
boundscodesfiniteringssingletoncommutativelinearquasi-frobenius
read the original abstract
In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The Singleton bounds for linear codes over such rings satisfy \[ \frac{d(C)-1}{A}\leq n-\log_{|R|}|C|. \]
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.