Maximum Distance Separable Convolutional Codes

1999 ◽  
Vol 10 (1) ◽  
pp. 15-32 ◽  
Author(s):  
Joachim Rosenthal ◽  
Roxana Smarandache
2016 ◽  
Vol 62 (2) ◽  
pp. 669-680 ◽  
Author(s):  
Joan-Josep Climent ◽  
Diego Napp ◽  
Carmen Perea ◽  
Raquel Pinto

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  

2021 ◽  
Vol 75 ◽  
pp. 101877
Author(s):  
Ángel Luis Muñoz Castañeda ◽  
Francisco J. Plaza-Martín

2021 ◽  
Vol 28 (04) ◽  
pp. 581-600
Author(s):  
Hai Q. Dinh ◽  
Hualu Liu ◽  
Roengchai Tansuchat ◽  
Thang M. Vo

Negacyclic codes of length [Formula: see text] over the Galois ring [Formula: see text] are linearly ordered under set-theoretic inclusion, i.e., they are the ideals [Formula: see text], [Formula: see text], of the chain ring [Formula: see text]. This structure is used to obtain the symbol-pair distances of all such negacyclic codes. Among others, for the special case when the alphabet is the finite field [Formula: see text] (i.e., [Formula: see text]), the symbol-pair distance distribution of constacyclic codes over [Formula: see text] verifies the Singleton bound for such symbol-pair codes, and provides all maximum distance separable symbol-pair constacyclic codes of length [Formula: see text] over [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document