Name
Abstract | ||
|---|---|---|
In this note, we study the classification of begin{document} $mathbb{Z}_4$ end{document} -codes. For some special cases begin{document} $(k_1,k_2)$ end{document} , by hand, we give a classification of begin{document} $mathbb{Z}_4$ end{document} -codes of length begin{document} $n$ end{document} and type begin{document} $4^{k_1}2^{k_2}$ end{document} satisfying a certain condition. Our exhaustive computer search completes the classification of begin{document} $mathbb{Z}_4$ end{document} -codes of lengths up to begin{document} $7$ end{document} . |
Year | Venue | Field |
|---|---|---|
2017 | Advances in Mathematics of Communications | Discrete mathematics,Combinatorics,Computer search,Mathematics |
DocType | Volume | Citations |
Journal | abs/1707.01356 | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Makoto Araya | 1 | 26 | 8.52 |
| Masaaki Harada | 2 | 367 | 69.47 |
| Hiroki Ito | 3 | 0 | 1.35 |
| Ken Saito | 4 | 0 | 1.35 |