Algorithms for computing parameters of graph-based extensions of BCH codes (Q2466021): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrei V. Kelarev / rank
Normal rank
 
Property / author
 
Property / author: Andrei V. Kelarev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2006.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046405103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-Magic Total Labelings Of Generalized Petersen Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending and lengthening BCH codes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New codes via the lengthening of BCH codes with UEP codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum Lee weights of Hensel lifts of some binary BCH codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and decoding of BCH codes over finite commutative rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding short and light codewords in BCH codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in general Abelian groups is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decoding of Reed-Solomon and BCH codes over integer residue rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2738740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Graphs With Fewer Than Twenty Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4534481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Hamming weights of BCH codes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:03, 27 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for computing parameters of graph-based extensions of BCH codes
scientific article

    Statements

    Algorithms for computing parameters of graph-based extensions of BCH codes (English)
    0 references
    11 January 2008
    0 references
    algorithms
    0 references
    codes
    0 references
    directed graphs
    0 references
    0 references

    Identifiers