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)

(More)

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

2015

2015

- Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic
- IEEE Transactions on Information Theory
- 2015

We introduce a new family of codes, termed asymmetric Lee distance (ALD) codes, designed to correct errors arising in DNA-based… (More)

Is this relevant?

2015

2015

- Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic
- 2015 IEEE Information Theory Workshop (ITW)
- 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)

Is this relevant?

2012

2012

- Luca G. Tallini, Bella Bose
- 2012 IEEE International Symposium on Information…
- 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)

Is this relevant?

2008

2008

- Yingquan Wu, Christoforos N. Hadjicostis
- IEEE Transactions on Communications
- 2008

The Lee metric measures the circular distance between two elements in a cyclic group and is particularly appropriate as a measure… (More)

Is this relevant?

2003

2003

- Bader F. AlBdaiwi, Bella Bose
- IEEE Trans. Information Theory
- 2003

A construction of perfect/quasiperfect Lee distance codes in is introduced. For this class of codes, a constant time encoding… (More)

Is this relevant?

1998

1998

- Sylvain Gravier, Michel Mollard, Charles Payan
- Eur. J. Comb.
- 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)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Bella Bose, Bob Broeg, Younggeun Kwon, Yaagoub Ashir
- IEEE Trans. Computers
- 1995

Is this relevant?

1994

1994

- Ron M. Roth, Paul H. Siegel
- IEEE Trans. Information Theory
- 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

- Patrick Solé
- Discrete Mathematics
- 1991

Sol&, P., On the parameters of codes for the Lee and modular distance, Discrete Mathematics 89 (1991) 185-194. We introduce the… (More)

Is this relevant?