Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,151,043 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Alexander Vardy
Coding theory
Hamming distance
Hamming space
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Negacyclic codes over the local ring ℤ4[v]/〈v2+2v〉 of oddly even length and their Gray images
Yuan Cao
,
Yonglin Cao
Finite Fields Their Appl.
2018
Corpus ID: 4738476
2016
2016
New few weight codes from trace codes over a local Ring
Shi Min-jia
,
Qian Liqin
,
Solé Patrick
2016
Corpus ID: 197527364
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
2015
2015
Asymmetric Lee Distance Codes for DNA-Based Storage
R. Gabrys
,
H. M. Kiah
,
O. Milenkovic
IEEE Transactions on Information Theory
2015
Corpus ID: 215361
We introduce a new family of codes, termed asymmetric Lee distance (ALD) codes, designed to correct errors arising in DNA-based…
Expand
2011
2011
Decoding q-ary lattices in the Lee metric
A. Campello
,
G. C. Jorge
,
S. Costa
IEEE Information Theory Workshop
2011
Corpus ID: 9569324
Q-ary lattices can be obtained from q-ary codes using the so-called Construction A. We investigate these lattices in the Lee…
Expand
2006
2006
Fast decoding of quasi-perfect Lee distance codes
P. Horák
,
Bader F. AlBdaiwi
Des. Codes Cryptogr.
2006
Corpus ID: 481390
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…
Expand
Highly Cited
2000
Highly Cited
2000
Efficient decoding algorithms for generalized Reed-Muller codes
K. Paterson
,
Alan E. Jones
IEEE Transactions on Communications
2000
Corpus ID: 7321528
Previously, a class of generalized Reed-Muller (RM) codes has been suggested for use in orthogonal frequency-division…
Expand
1998
1998
On the Non-existence of 3-Dimensional Tiling in the Lee Metric
Sylvain Gravier
,
M. Mollard
,
C. Payan
European journal of combinatorics (Print)
1998
Corpus ID: 37543282
We prove that there does not exist a tiling with Lee spheres of radius at least 2 in the 3-dimensional Euclidean space. In…
Expand
Highly Cited
1995
Highly Cited
1995
Lee Distance and Topological Properties of k-ary n-cubes
B. Bose
,
Bob Broeg
,
Younggeun Kwon
,
Yaagoub Ashir
IEEE Trans. Computers
1995
Corpus ID: 1123042
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
1995
1995
Lee distance Gray codes
B. Bose
,
Bob 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…
Expand
Highly Cited
1994
Highly Cited
1994
Lee-metric BCH codes and their application to constrained and partial-response channels
R. Roth
,
P. Siegel
IEEE Transactions on Information Theory
1994
Corpus ID: 2290998
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE