Block-triangularization of parity check matrices for efficient encoding of linear codes

@article{Shibuya2011BlocktriangularizationOP,
  title={Block-triangularization of parity check matrices for efficient encoding of linear codes},
  author={Tomoharu Shibuya},
  journal={2011 IEEE International Symposium on Information Theory Proceedings},
  year={2011},
  pages={533-537}
}
In this paper, we propose a new encoding algorithm for linear codes whose computational complexity is O(w(H)) where w(H) denotes the number of non-zero elements in a parity check matrix H of a code. The proposed algorithm is based on the block-triangularization — an efficient technique to solve a system of linear equations — of a parity part of a parity check matrix, combining additional row and column permutations. As a result, the proposed algorithm can encode any linear codes defined by… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Matching Theory

  • L. Lovász, M. D. Plummer
  • North Holland and Akadémiai Kiadó, .
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…