Recommendations · Decodability of group homomorphisms beyond the johnson bound. STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing.
In this work we give and analyze a Johnson-type bound for group codes considering the G-norm. Johnson bounds have been given for binary and q-ary codes [5, ...
The idea is to develop a mechanism that will generate a file system as per user specifications. This paper presents the concept of automatic file-systems ...
Sep 17, 2018 · Driven by applications in random linear network coding, the field of subspace coding has sparked a lot of interest recently among both ...
Co-authors ; A Johnson-type bound for group codes and lattices. M Aliasgari, MR Sadeghi, D Panario. ACM Commun. Comput. Algebra 49 (1), 16, 2015. 2015 ; 2013 ...
A Johnson-type bound for group codes and lattices. M Aliasgari, MR Sadeghi, D Panario. ACM Commun. Comput. Algebra 49 (1), 16, 2015. 2015. 2013 Index IEEE ...
Sep 7, 2007 · In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini ...
Missing: group lattices.
A Johnson-type bound for group codes and lattices · Author Picture Malihe ... A notion of multivariate BCH bounds and codes · Author Picture José Joaquín ...
at most 2n lattice points within distance λ1(Λ)/. √. 2 of the target (this is analogous to Johnson's bound for codes). On the other hand, for any constant ε ...
Missing: type | Show results with:type
Apr 19, 2021 · ... lattice. The following Johnson-type bound on the list size for arbitrary lattices is proved in [MG02, Chapter 5]. Theorem 5.1. Let Λ be a ...