Algorithms for computing parameters of graph-based extensions of BCH codes

@article{Kelarev2007AlgorithmsFC,
  title={Algorithms for computing parameters of graph-based extensions of BCH codes},
  author={Andrei V. Kelarev},
  journal={J. Discrete Algorithms},
  year={2007},
  volume={5},
  pages={553-563}
}
This paper develops combinatorial algorithms for computing parameters of extensions of BCH codes based on directed graphs. One of our algorithms generalizes and strengthens a previous result obtained in the literature before. © 2006 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.
5 Citations
44 References
Similar Papers

References

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

Relationship between adjacency matrices and super (a

  • K. A. Sugeng, M. Miller
  • d)-edge-antimagic-total labeling of graphs, J…
  • 2007
1 Excerpt

Exclusive sum labelings of trees

  • M. Tuga, M. Miller, J. Ryan, Z. Ryjáček
  • J. Combin. Math. Combin. Comput. 55
  • 2005
1 Excerpt

Graph labeling

  • J. A. Gallian
  • Electronic J. Combinatorics, Dynamic Survey DS6
  • 2005
1 Excerpt

Relationship between adjacency matrices and super ( a , d )edgeantimagictotal labeling of graphs

  • M. Miller K. A. Sugeng
  • J . Combin . Math . Combin . Comput .
  • 2005

Slamin

  • K. A. Sugeng, M. Miller
  • M. Bača, (a, d)-edge-antimagic total labelings of…
  • 2005

Super (a

  • K. A. Sugeng, M. Miller, Y. Lin, M. Bača
  • d)-vertex-antimagic total labelings, J. Combin…
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…