Group-theoretic analysis of cayley-graph-based cycle gf(2p) codes

@article{Huang2009GrouptheoreticAO,
  title={Group-theoretic analysis of cayley-graph-based cycle gf(2p) codes},
  author={Jie Huang and Shengli Zhou and Jinkang Zhu and Peter Willett},
  journal={IEEE Transactions on Communications},
  year={2009},
  volume={57}
}
Using group theory, we analyze cycle GF(2p) codes that use Cayley graphs as their associated graphs. First, we show that through row and column permutations the parity check matrix H can be put in a concatenation form of row-permuted block-diagonal matrices. Encoding utilizing this form can be performed in linear time and in parallel. Second, we derive a rule to determine the nonzero entries of H and present determinate and semi-determinate codes. Our simulations show that the determinate and… CONTINUE READING
8 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Fast decoding algorithm for LDPC codes over GF(2),

  • L. Barnault, D. Declercq
  • in Proc. IEEE Inform. Theory Workshop,
  • 2003
2 Excerpts

Optimizing sparse graph codes over GF(q),

  • D.J.C. Mackay
  • http://www.inference.phy.cam.ac.uk/mackay…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…