1. CMU Intellectual Repository

Search


Current filters:



Start a new search
Add filters:

Use filters to refine the search results.

 | 
Results 1-10 of 11 (Search time: 0.002 seconds).
Item hits:
Issue DateTitleAuthor(s)
1-Feb-2021Hamming distances of constacyclic codes of length 3p<sup>s</sup> and optimal codes with respect to the Griesmer and Singleton boundsHai Q. Dinh; Xiaoqiang Wang; Hongwei Liu; Woraphon Yamaka
1-Feb-2021A class of skew cyclic codes and application in quantum codes constructionHai Q. Dinh; Tushar Bag; Ashish K. Upadhyay; Ramakrishna Bandi; Roengchai Tansuchat
1-Jan-2021On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ringHai Q. Dinh; Narendra Kumar; Abhay Kumar Singh; Manoj Kumar Singh; Indivar Gupta; Paravee Maneejuk
1-Oct-2021Constacyclic codes of length (p<sup>r</sup>, p<sup>s</sup>) over mixed alphabetsHai Q. Dinh; Tushar Bag; Pramod Kumar Kewat; Sachin Pathak; Ashish K. Upadhyay; Warattaya Chinnakum
1-Jan-2021Quantum MDS and synchronizable codes from cyclic codes of length 5 p<sup>s</sup> over F<sup>pm</sup>Hai Q. Dinh; Bac T. Nguyen; Roengchai Tansuchat
1-May-2021On F<inf>2</inf>RS-cyclic codes and their applications in constructing optimal codesHai Q. Dinh; Sachin Pathak; Tushar Bag; Ashish Kumar Upadhyay; Ramakrishna Bandi; Woraphon Yamaka
1-May-2021An explicit expression for Euclidean self-dual cyclic codes over F<inf>2<sup>m</sup></inf>+uF<inf>2<sup>m</sup></inf> of length 2<sup>s</sup>Yuan Cao; Yonglin Cao; Hai Q. Dinh; Guidong Wang; Jirakom Sirisrisakulchai
1-Dec-2021Symbol-pair distances of repeated-root negacyclic codes of length 2<sup>s</sup>over Galois ringsHai Q. Dinh; Hualu Liu; Roengchai Tansuchat; Thang M. Vo
1-Oct-2021Symbol-pair distance of repeated-root constacyclic codes of prime power lengths over f<inf>p</inf>m[u]/〈u<sup>3</sup>〉Mohammed E. Charkani; Hai Q. Dinh; Jamal Laaouine; Woraphon Yamaka
1-Nov-2021Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length 4 p<sup>s</sup> over F<sup>pm</sup>Hai Q. Dinh; Ha T. Le; Bac T. Nguyen; Roengchai Tansuchat

Discover