Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An explicit method to generate some QC LDPC codes with girth 8

From MaRDI portal
Publication:2629828
Jump to:navigation, search

DOI10.1007/s40995-016-0008-9zbMath1342.94114OpenAlexW2314330066MaRDI QIDQ2629828

Zahra Gholami, Mohammad Gholami

Publication date: 7 July 2016

Published in: Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40995-016-0008-9

zbMATH Keywords

incidence matrixTanner graphquasi-cyclic low-density parity-check codesQC LDPC codes


Mathematics Subject Classification ID

Linear codes (general theory) (94B05)


Related Items

On the search of smallest QC-LDPC code with girth six and eight, Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers



Cites Work

  • Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
  • Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
  • Algebraic construction of sparse matrices with large girth
  • LDPC Block and Convolutional Codes Based on Circulant Matrices
  • Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
  • A recursive approach to low complexity codes
  • Factor graphs and the sum-product algorithm
  • On the Girth of Quasi-Cyclic Protograph LDPC Codes
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2629828&oldid=15427305"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 11:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki