Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0979.94052
Shiromoto, Keisuke
Singleton bounds for codes over finite rings. (English)
[J] J. Algebr. Comb. 12, No.1, 95-99 (2000). ISSN 0925-9899; ISSN 1572-9192/e

Let $R$ be a finite commutative quasi-Froebenius (QF) ring and let $V=R^n$ be the free module of rank $n$ consisting of all $n$-tuples of elements of $R$. A code $C$ of length $n$ over $R$ is an $R$-submodule of $V$. For every $x=(x_1,x_2, \dots,x_n) \in V$ and $r\in R$, the complete weight of $x$ is defined by $n_r(x)= |\{i \mid x_i=r\} |$. Let $a_0=0$ and $a_r$ be a positive real number for any nonzero $r\in R$. A general weight function $w(x)$ is defined by $$w(x)= \sum_{r\in R}a_r n_r(x).$$ For any linear $[n,k,d]$ code over a finite field, the Singleton bound says that $d\le n-k+1$. The main result here is the following generalization of the Singleton bound for a general weight function over $R$.\par Theorem. Let $C$ be a code with minimum distance $d$ over a finite commutative QF ring $R$. Let $w(x)$ be a general weight function on $C$. Then $$\bigl[(d-1)/ A\bigr]\le n-\log_{|R|} |C|,$$ where $A=\max\{a_r \mid r\in R\}$ and $[b]$ is the integer part of $b$.\par Finally, the author presents some applications of his result to codes over $\bbfZ_l$ (and in particular $\bbfZ_4)$ for the special weight functions corresponding to the Hamming, Lee and Euclidean weights.
[T.Helleseth (Bergen)]

MSC 2000:: *94B65 Bounds on codes
16L60 Quasi-Frobenius rings

Keywords: quasi-Froebenius ring; Hamming weights; Lee weights; general weight function; Singleton bound; Euclidean weights

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]