Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound-Reference-Cited by-同舟云学术

Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound

Published:2017 Issue: Volume: Page:163-191
ISSN:0302-9743
Container-title:Coding Theory and Applications
language:
Short-container-title:

Author:

Heinlein Daniel,Kurz Sascha

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-66278-7_15

Reference43 articles.

1. Agrell, E., Vardy, A., Zeger, K.: Upper bounds for constant-weight codes. IEEE Trans. Inform. Theory 46(7), 2373–2395 (2000)

2. Ahlswede, R., Aydinian, H.: On error control codes for random network coding. In: Workshop on Network Coding, Theory, and Applications, NetCod 2009, pp. 68–73. IEEE (2009)

3. Ahlswede, R., Aydinian, H.K., Khachatrian, L.H.: On perfect codes and related concepts. Des. Codes Crypt. 22(3), 221–237 (2001)

4. Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204–1216 (2000)

5. Ai, J., Honold, T., Liu, H.: The expurgation-augmentation method for constructing good plane subspace codes. arXiv preprint arXiv:1601.01502 (2016)

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

1. Asymptotically optimal [2k+1,k,k] -almost affinely disjoint subspaces;Discrete Mathematics;2024-10

2. New Constant Dimension Subspace Codes From the Mixed Dimension Construction;IEEE Transactions on Information Theory;2023-07

3. A New Construction of Asymptotically Optimal Almost Affinely Disjoint Spaces;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

4. New constructions of constant dimension codes by improved inserting construction;Applied Mathematics and Computation;2023-06

5. The interplay of different metrics for the construction of constant dimension codes;Advances in Mathematics of Communications;2023