Author:
Sakzad Amin,Sadeghi Mohammad-Reza,Panario Daniel
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference14 articles.
1. Augot D., vit Vehel F.L.: Bounds on the minimum distance of the duals of BCH codes. IEEE Trans. Inform. Theory 42, 1257–1260 (1996)
2. Etzion T., Trachtenberg A., Vardy A.: Which codes have cycle-free Tanner graphs?. IEEE Trans. Inform. Theory 45, 2173–2181 (1999)
3. Győri E.: C 6-free bipartite graphs and product representation of squares. Discrete Math. 165/166, 371–375 (1997)
4. Győri E.: Triangle-free hypergraphs. Comb. Probab. Comput. 15, 185–191 (2006)
5. Halford T.R., Chugg K.M.: The tradeoff between cyclic topology and complexity in graphical models of linear codes. Forty-Fourth Allerton Conf. on Commun., Control, and Computing, Monticello, IL, September (2006).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献