scholarly journals Generalized upper bounds on the minimum distance of PSK block codes

2014 ◽  
Vol 32 (2) ◽  
pp. 305-327
Author(s):  
E. Laksman ◽  
H. Lennerstad ◽  
M. Nilsson
1983 ◽  
Vol 62 (8) ◽  
pp. 2617-2646 ◽  
Author(s):  
A. R. Calderbank ◽  
J. E. Mazo ◽  
H. M. Shapiro

2000 ◽  
Vol 46 (3) ◽  
pp. 869-885 ◽  
Author(s):  
Po-Ning Chen ◽  
Tzong-Yow Lee ◽  
Y.S. Han

2013 ◽  
Vol 21 (3) ◽  
pp. 241-256 ◽  
Author(s):  
Manuel González Sarabia ◽  
Joel Nava Lara ◽  
Carlos Rentería Marquez ◽  
Eliseo Sarmíento Rosales

AbstractIn this paper we will compute the main parameters of the parameterized codes arising from cycles. In the case of odd cycles the corresponding codes are the evaluation codes associated to the projective torus and the results are well known. In the case of even cycles we will compute the length and the dimension of the corresponding codes and also we will find lower and upper bounds for the minimum distance of this kind of codes. In many cases our upper bound is sharper than the Singleton bound.


Sign in / Sign up

Export Citation Format

Share Document