Modeling hexagonal constellations with Eisenstein-Jacobi graphs-Reference-Cited by-同舟云学术

Modeling hexagonal constellations with Eisenstein-Jacobi graphs

Published:2008-03 Issue:1 Volume:44 Page:1-11
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Martínez C.,Stafford E.,Beivide R.,Gabidulin E. M.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://link.springer.com/content/pdf/10.1134/S0032946008010018.pdf

Reference13 articles.

1. Huber, K., Codes over Gaussian Integers, IEEE Trans. Inform. Theory, 1994, vol. 40, no. 1, pp. 207–216.

2. Contemp. Math.;K. Huber,1994

3. Costa, S.I.R., Muniz, M., Agustini, E., and Palazzo, R., Graphs, Tessellations, and Perfect Codes on Flat Tori, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 10, pp. 2363–2377.

4. Martínez, C., Beivide, R., Gutierrez, J., and Gabidulin, E., On the Perfect t-Dominating Set Problem in Circulant Graphs and Codes over Gaussian Integers, in Proc. 2005 IEEE Int. Sympos. on Information Theory (ISIT’05), Adelaide, Australia, 2005, pp. 254–258.

5. Martínez, C., Beivide, R., and Gabidulin, E., Perfect Codes for Metrics Induced by Circulant Graphs, IEEE Trans. Inform. Theory, 2007, vol. 53, no. 9, pp. 3042–3052.

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shortest node-to-node disjoint paths algorithm for symmetric networks;Cluster Computing;2024-06-15

2. Completely independent spanning trees in Eisenstein-Jacobi networks;The Journal of Supercomputing;2024-03-29

3. Panconnectivity algorithm for Eisenstein-Jacobi networks;Kuwait Journal of Science;2023-10

4. Quasi-Cyclic Perfect Codes in Doob Graphs and Special Partitions of Galois Rings;IEEE Transactions on Information Theory;2023-09

5. On the broadcast independence number of circulant graphs;Discrete Mathematics, Algorithms and Applications;2023-07-20