Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
type: Item
instance of: scholarly article
title: Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
zbMATH Open document ID: 1302.94071
DOI: 10.1134/S0032946011040028
published in: Problems of Information Transmission
publication date: 2013-11-01T00:00:00Z
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 6221897
author: Alexey Frolov
author: V. V. Zyablov
MaRDI profile type: Publication
cites work: A recursive approach to low complexity codes
cites work: Expander codes
cites work: Ramanujan graphs
cites work: Q4071451
cites work: On expander codes
cites work: Distance properties of expander codes
cites work: Upper bounds on the rate of LDPC codes as a function of minimum distance
cites work: Improved Nearly-MDS Expander Codes
cites work: Q5665102
cites work: Q5675263
cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
cites work: Weight distribution and decoding of codes on hypergraphs
description: scientific article; zbMATH DE number 6221897