Name
Abstract | ||
|---|---|---|
Integer codes are defined by error-correcting codes over integers modulo a fixed positive integer. In this paper, we show that the construction of integer codes can be reduced into the cases of prime-power moduli. We can efficiently search integer codes with small prime-power moduli and can construct target integer codes with a large composite-number modulus. Moreover, we also show that this prime-factorization reduction is useful for the construction of self-orthogonal and self-dual integer codes, i.e., these properties in the prime-power moduli are preserved in the composite-number modulus. Numerical examples of integer codes and generator matrices demonstrate these facts and processes. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1587/transfun.E101.A.1952 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
error-correcting codes, self-orthogonal codes, self-dual codes, codes over integer residue rings, Chinese remainder theorem | Integer,Discrete mathematics,Modulus,Factorization,Mathematics | Journal |
Volume | Issue | ISSN |
E101A | 11 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hajime Matsui | 1 | 18 | 8.14 |