Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Alexey Frolov / rank
 
Normal rank
Property / author
 
Property / author: Victor Zyablov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance properties of expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the rate of LDPC codes as a function of minimum distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Nearly-MDS Expander Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight distribution and decoding of codes on hypergraphs / rank
 
Normal rank

Latest revision as of 23:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
scientific article

    Statements

    Identifiers