On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes (Q1003680): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Morteza Esmaeili / rank
 
Normal rank
Property / author
 
Property / author: Ali Zaghian / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LDGM / 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.dam.2008.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001560763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New 5-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering radius 1985-1994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering radius---Survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four fundamental parameters of a code and their combinatorial significance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering radius of cyclic codes of length up to 31 (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3293678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covering radius of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative decoding of binary block and convolutional codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for counting short cycles in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covering radius of binary codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor graphs and the sum-product algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive approach to low complexity codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: LDGM codes for channel coding and joint source-channel coding of correlated sources / rank
 
Normal rank

Latest revision as of 03:36, 29 June 2024

scientific article
Language Label Description Also known as
English
On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes
scientific article

    Statements

    On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes (English)
    0 references
    4 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    covering radius
    0 references
    cycle distribution
    0 references
    LDGM codes
    0 references
    0 references
    0 references
    0 references