Perfect codes in the discrete simplex-Reference-Cited by-同舟云学术

Perfect codes in the discrete simplex

Published:2013-11-05 Issue:1 Volume:75 Page:81-95
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Kovačević Mladen,Vukobratović Dejan

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-013-9893-5.pdf

Reference36 articles.

1. Aigner M.: Combinatorial Theory. Springer, New York (1979).

2. AlBdaiwi B., Horak P., Milazzo L.: Enumerating and decoding perfect linear Lee codes. Des. Codes Cryptogr. 52(2), 155–162 (2009).

3. Astola J.: On perfect Lee codes over small alphabets of odd cardinality. Discret. Appl. Math. 4, 227–228 (1982).

4. Bange D.W., Barkauskas A.E., Slater P.J.: Efficient dominating sets in graphs. In: Ringeisen R.D., Roberts F.S. (eds.) Applications of Discrete Mathematics, pp. 189–199. SIAM, Philadelphia (1988).

5. Bertsekas D.P., Gallager R.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1992).

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

1. Permutation Capacity Region of Adder Multiple-Access Channels;IEEE Transactions on Information Theory;2024-07

2. Sphere Decoding for Multiset Codes in Noisy Permutation Channels;2023 3rd International Conference on Electronic Information Engineering and Computer Communication (EIECC);2023-12-22

3. Capacity of Noisy Permutation Channels;IEEE Transactions on Information Theory;2023-07

4. Permutation Sum-Capacity of Binary Adder Multiple-Access Channels;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

5. New results on ternary constant weight codes under ${\boldsymbol\ell}_{\boldsymbol1}$-metric;SCIENTIA SINICA Mathematica;2022-08-23