A method to find the volume of a sphere in the Lee metric, and its applications

Author(s):  
Sagnik Bhattacharya ◽  
Adrish Banerjee
Keyword(s):  
2009 ◽  
Vol 30 (2) ◽  
pp. 480-489 ◽  
Author(s):  
P. Horak
Keyword(s):  

1971 ◽  
Vol 19 (2) ◽  
pp. 159-173 ◽  
Author(s):  
J. Chung-yaw Chiang ◽  
Jack K. Wolf
Keyword(s):  

1970 ◽  
Vol 18 (2) ◽  
pp. 302-317 ◽  
Author(s):  
Solomon W. Golomb ◽  
Lloyd R. Welch
Keyword(s):  

2010 ◽  
Vol 17 (spec01) ◽  
pp. 727-740 ◽  
Author(s):  
Sapna Jain
Keyword(s):  

In this paper, we introduce a pseudo-metric on the space of all m × s matrices with entries from the finite ring Zq, generalizing the classical Lee metric and the array RT metric, and name this pseudo-metric as the generalized Lee-RT pseudo-metric (or the GLRTP-metric). We also obtain some bounds on the parameters of array codes equipped with the GLRTP-metric.


10.37236/1746 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Jörn Quistorff

In coding theory, Plotkin's upper bound on the maximal cadinality of a code with minimum distance at least $d$ is well known. He presented it for binary codes where Hamming and Lee metric coincide. After a brief discussion of the generalization to $q$-ary codes preserved with the Hamming metric, the application of the Plotkin bound to $q$-ary codes preserved with the Lee metric due to Wyner and Graham is improved.


2003 ◽  
Vol 39 (21) ◽  
pp. 1522 ◽  
Author(s):  
X.-W. Wu ◽  
M. Kuijper ◽  
P. Udaya

2008 ◽  
Vol 56 (12) ◽  
pp. 2050-2059 ◽  
Author(s):  
Yingquan Wu ◽  
Christoforos Hadjicostis

Sign in / Sign up

Export Citation Format

Share Document