Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Polygon Semi regular Low Density Parity Check Codes

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

Khalil Shah

Língua

Inglês

Livro Capa mole

Código Libristo: 06833736

Editoras VDM Verlag, junho 2010

I proposed a new algorithm for the allocation of g- values to the binary vectors. An infinite family... Descrição completa

Código Libristo: 06833736

108 b

44.80 €

Sob encomenda da editora Envio em 17-27 dias

Até 30 dias para devoluções

Os clientes também compraram

Al infierno con mi candil BUENO ANDRES

Capa mole

16.38 €

Niekonwencjonalna produkcja ropy naftowej w USA George Ashcroft

Capa mole

41.87 €

Lesní škola Petera Wohllebena Peter Wohlleben

Livro de capa dura

11.72 €

Autonomie Des Lichens Ou Refutation Du Schwendenerisme RICHARD-O

Capa mole

13.14 €

LA CATALUNYA IBERA NURIA ARMENGOL

Capa mole

19.82 €

D veloppement D Un Portail D Entreprise Azouz-S

Capa mole

55.32 €

Synchronies Valentina Grassi

Capa mole

49.46 €

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

Capa mole

57.85 €

Pdc Et Trail Dans Le Cancer Ariane Blum

Capa mole

71.20 €

tude de la R ponse Sismique Non Lin aire Nourredine Belhamdi

Capa mole

32.77 €

100 Songs für 3 Akkorde Frithjof Krepp

Capa mole

18.60 €

Vermogenskultur Thomas Druyen

Livro de capa dura

49.05 €

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.