Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. Linear programming bounds for tree codes;Aaltonen;IEEE Trans. Inf. Theory,1977
2. Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance;Aaltonen;Ann. Univ. Turku Ser. A I,1981
3. Notes on the asymptotic behavior of the information rate of block codes;Aaltonen;IEEE Trans. Inf. Theory,1984
4. Orthogonal polynomials and special functions;Askey,1975
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distribution of the Minimum Distance of Random Linear Codes;IEEE Transactions on Information Theory;2022-10
2. Linear Programming Bounds for Approximate Quantum Error Correction Over Arbitrary Quantum Channels;IEEE Transactions on Information Theory;2022-08
3. Improved Bounds for (b, k)-Hashing;IEEE Transactions on Information Theory;2022-08
4. Asymptotic Bounds on the Rate of Locally Repairable Codes;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12
5. New upper bounds for (b, k)-hashing;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12