Upper Bounds

for
Ring-Linear
Codes Upper Bounds for Ring-Linear Codes
Eimear Byrne,
Marcus
Greferath,
Axel Kohnert,
Vitaly Eimear Byrne1 , Marcus Greferath1 , Axel Kohnert2 ,
Skachek
Vitaly Skachek1

1 Claude Shannon Institute and

School of Mathematical Sciences

University College Dublin
Ireland

2 Dept Mathematics

University of Bayreuth
Germany

May 19 2009
 Outline

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath,
Axel Kohnert, Codes over finite fields
Vitaly
Skachek Code optimality
Bounds for codes for the Hamming weight
Ring-linear coding
The homogeneous weight
Bounds on the size of a code for the homogeneous weight
 Notation

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath,
Axel Kohnert,
Vitaly F = GF (q), q = p m some prime p
Skachek
R is a finite ring with identity
R̂ := HomZ (R, C× ) the characters on (R, +)
χ ∈ R̂ is a character on (R, +)
C is a code of length n and minimum distance d
 Using Codes for Error Correction

Upper Bounds
for
One parameter that indicates the error-correcting capability of
Ring-Linear
Codes
a code is its minimum distance.
Eimear Byrne,
Marcus
Greferath,
Axel Kohnert,
Vitaly
Skachek
 Using Codes for Error Correction

Upper Bounds
for
One parameter that indicates the error-correcting capability of
Ring-Linear
Codes
a code is its minimum distance.
Eimear Byrne,
The higher the minimum distance, the more errors that can be
Marcus
Greferath,
detected and corrected by the receiver.
Axel Kohnert,
Vitaly
Skachek
 Using Codes for Error Correction

Upper Bounds
for
One parameter that indicates the error-correcting capability of
Ring-Linear
Codes
a code is its minimum distance.
Eimear Byrne,
The higher the minimum distance, the more errors that can be
Marcus
Greferath,
detected and corrected by the receiver.
Axel Kohnert,
Vitaly
Skachek
 Using Codes for Error Correction

Upper Bounds
for
One parameter that indicates the error-correcting capability of
Ring-Linear
Codes
a code is its minimum distance.
Eimear Byrne,
The higher the minimum distance, the more errors that can be
Marcus
Greferath,
detected and corrected by the receiver.
Axel Kohnert,
Vitaly
Skachek
 Code Optimality

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne, The Main Coding Problem:

Marcus
Greferath,
Axel Kohnert,
Vitaly
Skachek 1 For fixed length n and minimum distance d, what is the
maximum size of any code over R?
i.e., what is AR (n, d)?

2 For a fixed length n and minimum distance d, what is the

maximum size of any linear code over R?
i.e., what is BR (n, d)?
 Some Distance Functions

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Definition (Hamming Metric)
Marcus
Greferath,
Axel Kohnert,
Let u, v ∈ R n . The Hamming distance between u and v is the
Vitaly
Skachek
number of components where u and v differ, i.e.

dHam (u, v) = |{i : ui 6= vi }|

u = [0, 0, 1, 1, 3, 3], v = [1, 2, 2, 1, 1, 3] ∈ Z4

dHam (u, v) = 4.
 Some Distance Functions

Upper Bounds
for
Ring-Linear
Codes Definition (Lee Metric)
Eimear Byrne,
Marcus Let u, v ∈ Zm . The Lee distance between u and v is the
Greferath,
Axel Kohnert, absolute value modulo m of u − v , i.e.
Vitaly
Skachek 
u − v if u − v ∈ {0, ..., bm/2c}
dLee (u, v ) = |u − v |m =
v − u otherwise

If u, v ∈ Znm then dLee (u, v) = i=1..n |ui − vi |m .

P

u = [0, 0, 1, 1, 3, 3], v = [1, 2, 2, 1, 1, 3] ∈ Z4

dLee (u, v) = 1 + 2 + 1 + 2 = 6
 Some Bounds for Codes over Finite Fields

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus Singleton: |C | ≤ Aq (n, d) ≤ q n−d+1
Greferath,
Axel Kohnert, qn
Vitaly Hamming: |C | ≤ Aq (n, d) ≤ Vq (n,b d−1 c)
,
Skachek 2
d q−1 d
Plotkin: |C | ≤ Aq (n, d) ≤ d−γn , γ = q , if n < γ
qn
Gilbert-Varshamov: Aq (n, d) ≥ Vq (n,d−1)
Elias-Bassalygo bound
Mc-Eliece-Rodemich-Rumsey-Welch bound
Linear Programming bound
 Asymptotic Representations

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath,
Axel Kohnert,
Vitaly
Skachek
 Codes over Finite Rings

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus Definition
Greferath,
Axel Kohnert, An code of length n over R is a nonempty subset of R n . A
Vitaly
Skachek (left) linear code of length n over R is a left R-submodule of
R n.
We will usually assume that R is a finite Frobenius ring.
Many of the foundational results of classical coding theory (e.g.
the MacWilliams’ theorems) can be extended to the finite ring
case when R is Frobenius.
[Wood, Honold, Nechaev, Greferath, Schmidt..]
 Finite Frobenius Rings

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus For a finite ring R, R̂ is an R − R bimodule via
Greferath,
Axel Kohnert,
Vitaly
Skachek χr (x) = χ(rx), r
χ(x) = χ(xr )

for all x, r ∈ R, χ ∈ R̂.

R is a finite Frobenius ring iff

RR ' R R̂

Then R R̂ = R hχi for some (left) generating character χ

 Finite Frobenius Rings

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus Let R and S be finite Frobenius rings, let G be a finite group.
Greferath,
Axel Kohnert, The following are examples of Frobenius rings.
Vitaly
Skachek integer residue rings Zm
Galois rings
principal ideal rings
R ×S
the matrix ring Mn (R)
the group ring R[G ]
 Homogeneous Weights

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath, Definition
Axel Kohnert,
Vitaly A weight w : R −→ Q is (left) homogeneous, if w (0) = 0 and
Skachek
1 If Rx = Ry then w (x) = w (y ) for all x, y ∈ R.
2 There exists a real number γ such that
X
w (y ) = γ |Rx| for all x ∈ R \ {0}.
y ∈Rx
 Examples of Homogeneous Weights

Upper Bounds
for Example
Ring-Linear
Codes
On every finite field Fq the Hamming weight is a homogeneous
Eimear Byrne,
Marcus weight of average value γ = q−1q .
Greferath,
Axel Kohnert,
Vitaly
Skachek
Example
On Z4 the Lee weight is homogeneous with γ = 1.

x 0 1 2 3
wLee (x) 0 1 2 1
 Examples of Homogeneous Weights

Upper Bounds
for Example
Ring-Linear
Codes
On Z10 the following weight is homogeneous with γ = 1:
Eimear Byrne,
Marcus
Greferath, x 0 1 2 3 4 5 6 7 8 9
Axel Kohnert, 5 5 5 5
Vitaly whom (x) 0 1 4 1 4 2 4 1 4 1
Skachek
 Examples of Homogeneous Weights

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath, Example
Axel Kohnert,
Vitaly
Skachek
On the ring R of 2 × 2 matrices over GF(2) the weight

 0 : X = 0,
w : R −→ R, X 7→ 2 : X singular, X 6= 0,
1 : otherwise,


is a homogeneous weight of average value γ = 32 .

 Examples of Homogeneous Weights

Upper Bounds
for
Ring-Linear
Codes Example
Eimear Byrne,
Marcus
Greferath,
On a local Frobenius ring R with q-element residue field the
Axel Kohnert,
Vitaly
weight
Skachek

 0 : x = 0,
q
w : R −→ R, x 7→ : x ∈ soc(R), x 6= 0,
 q−1
1 : otherwise,

is a homogeneous weight of average value γ = 1.

Which finite rings admit a homogeneous weight?

Up to the choice of γ, every finite ring admits a unique
homogeneous weight .
 Homogeneous Weights of FFRs

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath, Theorem (Honold)
Axel Kohnert,
Vitaly
Skachek Let R be a finite Frobenius ring with generating character χ.
Then the homogeneous weights on R are precisely the functions
h 1 X i
w : R −→ R, x 7→ γ 1 − χ(xu)
|R × | ×
u∈R

where γ is a real number.

 Bounds on AR (n, d) for the Homogeneous Weight

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
The following bounds have been found for codes over FFRs for
Greferath,
Axel Kohnert,
the homogeneous weight.
Vitaly
Skachek Sphere-packing (Hamming)
Sphere-covering (Gilbert-Varshamov)
Plotkin-like bounds
Elias-like bounds
Singleton-like bound
Linear programming bound
 A Key Lemma

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath,
Axel Kohnert,
Vitaly
Lemma
Skachek
Let C ≤ R R n be a linear code, and let x ∈ R n . Then
1 X X
w (x + c) = γ|supp(C )| + w (xi ).
|C |
c∈C i6∈supp(C )
 Residual Codes

Upper Bounds
Definition
for
Ring-Linear Let C ≤R R n , c ∈ R n . Res(C , c) := {(xi ) : x ∈ C , ci 6= 0}.
Codes

Eimear Byrne,
Example
Marcus
Greferath, Let C be the Z4 -linear code generated by
Axel Kohnert,
Vitaly  
Skachek
1 0 0 0 3 1 2 1
 0 1 0 0 1 2 3 1 
 .
 0 0 1 0 3 3 3 2 
0 0 0 1 2 3 1 1

Let c = [0, 0, 0, 2, 0, 2, 2, 2]. Then Res(C , c) is generated by

 
1 0 0 3
 0 1 0 1 
 .
 0 0 1 3 
0 0 0 2
 Residual Codes

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne, Theorem

Marcus
Greferath,
Axel Kohnert, Let C ≤ R R n have minimum homogeneous weight d, and let
Vitaly
Skachek
c ∈ C satisfy `(c) := wHam < dγ . Then Res(C , c) has
length n − `(c),
minimum homogeneous weight d 0 ≥ d − γ`(c),
|C |
|Res(C , c)| = and
|Rc|
d − γ`(c)
|C | ≤ |Rc| .
d − γn
 Bounds on BR (n, d) for the Homogeneous Weight

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath,
Axel Kohnert, Corollary (BGKS)
Vitaly
Skachek
Let C ≤ R R n be a linear code of minimum homogeneous weight
d and minimum Hamming weight ` where ` ≤ n ≤ dγ . Then

d − γ`
|C | ≤ |R| .
d − γn
 Bounds on BR (n, d) for the Homogeneous Weight

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Marcus
Greferath, Corollary (BGKS)
Axel Kohnert,
Vitaly
Skachek Let C ≤ R R n be a linear code of minimum homogeneous
weight d and minimum Hamming weight ` where ` < n ≤ dγ .
Let Q be the maximum size of any minimal ideal of R. Then
d − γ`
|C | ≤ Q .
d − γn
 A Plotkin Optimal Code

Upper Bounds
for
Ring-Linear
Example
Codes

Eimear Byrne,
Let R = F2×2 m
2 . Let C be the length 16 − 1 Simplex Code over
Marcus
Greferath,
R. Then |C | = 16m ,
Axel Kohnert,

d = |R|m γ = 16m γ,
Vitaly
Skachek

16m 3
` := dHam (C ) = 16m − = 16m .
4 4
R has 3 minimal ideals, each of size Q = 4 and so
d − γ`
|C | ≤ Q
d − γn
16m γ − 34 16m γ 16m
= 4 m = 4 = 16m .
16 γ − (16m − 1)γ 4
 Bounds on BR (n, d) for the Homogeneous Weight

Upper Bounds
for
Singleton-like bounds:
Ring-Linear
Codes
Theorem (BGKS)
Eimear Byrne,
Marcus
Greferath, Let C ≤ RR
nbe an [n, d] linear code and suppose that n ≤ dγ .
Axel Kohnert,
Vitaly Then   l
Skachek |R| − 1 d m
n− ≥ log|R| |C | − 1 .
|R| γ

Theorem (BGKS)
Let C be an [n, d] code over R satisfying n ≤ dγ and `(C ) < n.
Let P := max{|Ra| : a ∈ R n , Ra ≤ C , `(a) < n}. Then
 
P −1d
n− ≥ dlogP |C | − logP |R|e .
P γ
 A Class of MDS Codes

Upper Bounds
for
Ring-Linear
Codes

Eimear Byrne,
Example
Marcus
Greferath, Let R be a chain ring of length 2. Then R × = R\rad R and
Axel Kohnert,
Vitaly |R| = q 2 . Let U := R 2 \rad R 2 , let P := {xR : x ∈ U}. Then
Skachek
|P| = q 2 + q.
Let C < R R n be the length n := q 2 + q code with 2 × n
generator matrix whose columns are the distinct elements of P.
Clearly `(c) < n for each c ∈ C .
C is free of rank 2 and the maximal cyclic submodules of C
have size P := |R| = q 2 .
Let r = dlogP |C | − 1e = logq2 q 4 − 1 = 1.
Upper Bounds Example (cont.)
for
Ring-Linear
Codes Setting γ = 1, each word xG of C has weight
Eimear Byrne, (
Marcus
Greferath,
q 2 + q if x ∈ U
w (xG ) = q3 ,
Axel Kohnert,
Vitaly q−1 if x ∈ radR 2
Skachek

q2 − 1 2
   
P −1
=⇒ n − d = n− (q + q)
P q2
 
2 1
= n− q +q−1−
q
= q2 + q − q2 − q + 1 = 1 = r .
 References

Upper Bounds
for E. Byrne, M. Greferath and M. E. O’Sullivan, The linear
Ring-Linear
Codes programming bound for codes over finite Frobenius rings,
Eimear Byrne, Designs, Codes and Cryptography, Vol. 42 , 3 (2007), pp.
Marcus
Greferath, 289 - 301.
Axel Kohnert,
Vitaly
Skachek
I. Constantinescu and W. Heise, A metric for codes over
residue class rings of integers, Problemy Peredachi
Informatsii 33 (1997), no. 3, 22–28.
M. Greferath and M. E. O’Sullivan, On Bounds for Codes
over Frobenius Rings under Homogeneous Weights,
Discrete Mathematics 289 (2004), 11–24.
T. Honold, A characterization of finite Frobenius rings,
Arch. Math. (Basel), 76 (2001), 406–415.
J. A. Wood, Duality for modules over finite rings and
applications to coding theory, Amer. J. Math. 121
(1999), 555–575.