Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2015
2015
We introduce a new family of codes, termed asymmetric Lee distance (ALD) codes, designed to correct errors arising in DNA-based… 
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… 
2006
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… 
Highly Cited
2000
Highly Cited
2000
Previously, a class of generalized Reed-Muller (RM) codes has been suggested for use in orthogonal frequency-division… 
1998
1998
We prove that there does not exist a tiling with Lee spheres of radius at least 2 in the 3-dimensional Euclidean space. In… 
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… 
1995
1995
  • B. BoseBob Broeg
  • Proceedings of IEEE International Symposium on…
  • 1995
  • Corpus ID: 120788115
Presents 4 methods of generating a Lee distance Gray code. The first two methods presented are for radix k numbers, and the other… 
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…