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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
0246819772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We introduce a new family of codes, termed asymmetric Lee distance (ALD) codes, designed to correct errors arising in DNA-based… (More)
  • figure 1
  • figure 2
  • table I
Is this relevant?
2015
2015
We continue our study of a new family of asymmetric Lee codes that arise in the design and implementation of emerging DNA-based… (More)
  • figure 1
  • figure 2
  • table II
Is this relevant?
2012
2012
This paper gives some new theory and design of codes capable of correcting/detecting errors measured under the Lee distance… (More)
Is this relevant?
2010
2010
A new series of Z4-linear codes of high minimum Lee distance is given. It is derived from the Z4-linear representation of the… (More)
  • table I
  • table IV
Is this relevant?
2008
2008
The Lee metric measures the circular distance between two elements in a cyclic group and is particularly appropriate as a measure… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2003
2003
A construction of perfect/quasiperfect Lee distance codes in is introduced. For this class of codes, a constant time encoding… (More)
  • figure 1
Is this relevant?
1998
1998
Let r be a nonnegative integer. The r-Lee sphere inRn centred on 0 of major axis E e1, . . . , E en is the set of n-cubes C(Y… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 9
Is this relevant?
Highly Cited
1995
1994
1994
We show that each code in a certain class of BCH codes over GF (p), specified by a code length n ≤ p−1 and a runlength r ≤ (p−1… (More)
Is this relevant?
1991
1991
Sol&, P., On the parameters of codes for the Lee and modular distance, Discrete Mathematics 89 (1991) 185-194. We introduce the… (More)
  • table 1
Is this relevant?