eCite Digital Repository

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

Citation

Kelarev, AV, Algorithms for computing parameters of graph-based extensions of BCH codes, Journal of Discrete Algorithms, 5, (3) pp. 553-563. ISSN 1570-8667 (2006) [Refereed Article]

DOI: doi:10.1016/j.jda.2006.08.002

Abstract

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.

Item Details

Item Type:Refereed Article
Research Division:Information and Computing Sciences
Research Group:Data Format
Research Field:Data Structures
Objective Division:Manufacturing
Objective Group:Communication Equipment
Objective Field:Voice and Data Equipment
Author:Kelarev, AV (Dr Andrei Kelarev)
ID Code:49341
Year Published:2006
Funding Support:Australian Research Council (DP0449469)
Deposited By:Computing
Deposited On:2007-08-01
Last Modified:2011-11-04
Downloads:0

Repository Staff Only: item control page