Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q
Journal of Combinatorial Theory Series B
Monomial Ideals, Group Algebras and Error Correcting Codes
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Explicit constructions of Ramanujan complexes of type Ad
European Journal of Combinatorics - Special issue on combinatorics and representation theory
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
IEEE Transactions on Information Theory - Part 1
A recursive approach to low complexity codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Transitive and self-dual codes attaining the Tsfasman-Vla˘dut$80-Zink bound
IEEE Transactions on Information Theory
Some randomized code constructions from group actions
IEEE Transactions on Information Theory
Self-Dual Doubly Even 2-Quasi-Cyclic Transitive Codes Are Asymptotically Good
IEEE Transactions on Information Theory
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We present the first explicit construction of a binary symmetric code with constant rate and constant distance (i.e., good code). Moreover, the code is LDPC and its constraint space is generated by the orbit of one constant weight constraint under the group action. Our construction provides the first symmetric LDPC good codes. In particular, it solves the main open problem raised by Kaufman and Wigderson {8}.