Lee distance

In coding theory, the Lee distance is a distance between two strings and of equal length n over the q-ary alphabet {0, 1, …, q − 1} of size q ≥ 2.It…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

In this paper, new few weights linear codes over the local ring $R=\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ with…

2016

Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius $t=1$ or dimension $n=1, 2$. It is…

2008

The class of the quadratic residue codes (QR-codes) over the ring Zopf4 contains very good Zopf4-linear codes. It is well known…

2007

Cayley graphs over quotients of the quaternion integers are going to be used to define a new metric over four dimensional…

2006

A code D over Z2n is called a quasi-perfect Lee distance-(2t + 1) code if dL(V,W) ≥ 2t + 1 for every two code words V,W in D, and…

2003

A construction of perfect/quasiperfect Lee distance codes in Z/sub K//sup 2/ is introduced. For this class of codes, a constant…

2001

Highly Cited

1998

Highly Cited

1998

OFDM, power, Reed-Muller code, decoding, algorithms, error correction Recently a class of generalised Reed-Muller codes has been…

1995

Sequential decoding of the channel code in a trellis-coded modulation system with trellis shaping can be used to reduce the…

1973