Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 9.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Polygon Semi regular Low Density Parity Check Codes

Name: Polygon Semi regular Low Density Parity Check Codes
Brand: VDM Verlag
SKU: 06833736
Price: 49.94 EUR
Availability: InStock
Author: Khalil Shah
ISBN: 9783639264098

Khalil Shah

Language

English

Book Paperback

Libristo code: 06833736

Publishers VDM Verlag, June 2010

I proposed a new algorithm for the allocation of g- values to the binary vectors. An infinite family... Full description

Libristo code: 06833736

121 b

49.94 €

Print on demand Shipping in 17-27 days

Up to 30 days for returns

Customers also purchased

Lesní škola Petera Wohllebena Peter Wohlleben

Hardback

14.25 €

Niekonwencjonalna produkcja ropy naftowej w USA George Ashcroft

Paperback

44.48 €

Autonomie Des Lichens Ou Refutation Du Schwendenerisme RICHARD-O

Paperback

14.55 €

LA CATALUNYA IBERA NURIA ARMENGOL

Paperback

22.84 €

Al infierno con mi candil BUENO ANDRES

Paperback

19.00 €

D veloppement D Un Portail D Entreprise Azouz-S

Paperback

58.74 €

Synchronies Valentina Grassi

Paperback

52.57 €

Modelo de triple diagnostico para el beneficiado del cafe Espinosa Mejia Francisco

Paperback

61.47 €

Pdc Et Trail Dans Le Cancer Ariane Blum

Paperback

75.52 €

tude de la R ponse Sismique Non Lin aire Nourredine Belhamdi

Paperback

51.66 €

100 Songs für 3 Akkorde Frithjof Krepp

Paperback

19.71 €

Vermogenskultur Thomas Druyen

Hardback

51.86 €

I proposed a new algorithm for the allocation of g- values to the binary vectors. An infinite family of simple graphs in generated by placing copies of polygons in parallel such that degree of each vertex is three. We call them polygon graphs. Since polygon graphs are bipartite therefore they can be used as Tanner graphs to generate low density parity check codes. An incidence structure defined on these polygon graphs in named as polygon semi design. Rows of incidence matrix are reduced by deleting rows from the bottom one by one. These matrices serve as parity check matrices to define low density parity check codes for various dimensions. Size of the stopping sets in the associated Tanner graphs of LDPC codes determine the performance of codes over binary erasure channel. The generated polygon semi regular LDPC codes are simulated and their performance is presented by BER. plots. There exists polygon semi regular LDPC codes e.g. (25,4,17), (49,6,19) etc. The LDPC codes of girth 6 presented by Vera Pless has parameters (25,4,10), (49,6,14). This shows a significant improvement in terms of minimum distance.