More on the Stopping and Minimum Distances of Array Codes

@article{Esmaeili2011MoreOT,
  title={More on the Stopping and Minimum Distances of Array Codes},
  author={Morteza Esmaeili and Mohammad Hesam Tadayon and T. Aaron Gulliver},
  journal={IEEE Transactions on Communications},
  year={2011},
  volume={59},
  pages={750-757}
}
For q an odd prime and 1≤ m ≤ q, two specific binary qm × q<sup>2</sup> parity-check matrices denoted by H<sub>P</sub>(m, q) and H<sub>I</sub>(m, q) are considered. The corresponding binary codes, C<sub>P</sub>(m, q) and C<sub>I</sub>(m, q), respectively, are called proper and improper array codes with parameters m and q. Given a parity-check matrix H representing a binary code C, let s(H) denote the stopping distance of H and d(C) be the minimum Hamming distance of C. It is known that that s(H… CONTINUE READING
15 Citations
21 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

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

Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes

  • M. Esmaeili, V. Ravanmehr
  • Utilitas Mathematica, vol. 76, pp. 265–276, July…
  • 2008

Similar Papers

Loading similar papers…