Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
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… Expand
  • table I
  • table III
  • table IV
  • table V
Is this relevant?
2015
2015
We introduce a new family of codes, termed asymmetric Lee distance (ALD) codes, designed to correct errors arising in DNA-based… Expand
  • figure 1
  • figure 2
  • table I
Is this relevant?
2011
2011
Q-ary lattices can be obtained from q-ary codes using the so-called Construction A. We investigate these lattices in the Lee… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
In this contribution, we will define an l-dimensional Lee distance which is a generalization of the Lee distance defined only… Expand
Is this relevant?
2008
2008
The class of the quadratic residue codes (QR-codes) over the ring Zopf4 contains very good Zopf4-linear codes. It is well known… Expand
Is this relevant?
1998
1998
The torus is a topology that is the basis for the communication network of several multicomputers in use today. This paper… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In this paper, we consider various topological properties of a k-ary n-cube (Q/sub n//sup k/) using Lee distance. We feel that… Expand
Is this relevant?
1995
1995
Presents 4 methods of generating a Lee distance Gray code. The first two methods presented are for radix k numbers, and the other… Expand
Is this relevant?
1995
1995
In this paper, we consider various topological properties of a k-ary n-cube $(Q^k_n)$ using Lee distance. We feel that Lee… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Shows that each code in a certain class of BCH codes over GF(p), specified by a code length n/spl les/p/sup m/-1 and a runlength… Expand
Is this relevant?