.:. Browse > By author > Andriyanova .:.

26 documents ordered by : Date Title first author name document type Submit date

1 - 2

Designing a Good Low-Rate Sparse-Graph Code Andriyanova I. et al Communications, IEEE Transactions on (2012) 3181 - 3190 [hal-00770199 - version 1]

Optimized IR-HARQ Schemes Based on Punctured LDPC Codes Over the BEC Andriyanova I. et al Information Theory, IEEE Transactions on (2012) 6433 - 6445 [hal-00770195 - version 1]

Spatially coupled quantum LDPC codes Andriyanova I. et al Dans Information Theory Proceedings (ITW), IEEE 2012 Workshop on - Information Theory Proceedings (ITW), IEEE 2012 Workshop on, Suisse (2012) [hal-00770232 - version 1]

Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel Ivashkina M. et al Dans Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on - Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, États-Unis (2012) [hal-00770192 - version 1]

Quantum LDPC codes obtained by non-binary constructions Andriyanova I. et al Dans Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on - Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, États-Unis (2012) [hal-00770187 - version 1]

Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel Ivashkina M. et al Dans Proceedings of 2012 IEEE International Symposium on Information Theory - ISIT 2012, États-Unis (2012) [hal-00749333 - version 1]

New constructions of CSS codes obtained by moving to higher alphabets Andriyanova I. et al Research report [hal-00671659 - version 1]

Joint channel estimation and decoding of root LDPC codes in block-fading channels Andriyanova I. et al Dans Proceedings of Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE - Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE, États-Unis (2011) [hal-00671662 - version 1]

Block-markov LDPC scheme for half-and full-duplex erasure relay channel Ivashkina M. et al Dans Proceedings of IEEE International Symposium on Information Theory (ISIT 2011) - IEEE International Symposium on Information Theory (ISIT 2011), Russie, Fédération De (2011) [hal-00634557 - version 1]

Some Results on Update Complexity of a Linear Code Ensemble Jule A. et al Dans Network Coding (NetCod), 2011 International Symposium on - Network Coding (NetCod), 2011 International Symposium on, Chine (2011) [hal-00671664 - version 1]

Some Results on MAP Decoding of Non-Binary LDPC Codes Over the BEC Rathi V. et al IEEE Transactions on Information Theory 57 (2011) 2225-2245 [hal-00591832 - version 1]

On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes Andriyanova I. et al [hal-00671660 - version 1] (18/02/2012)

On iterative performance of LDPC and Root-LDPC codes over block-fading channels Andriyanova I. et al 48th Annual Allerton Conference on Communication, Control, and Computing, États-Unis (2010) [hal-00591838 - version 1]

Waterfall region performance of punctured LDPC codes over the BEC Andriyanova I. et al Dans Proceeding of the ISIT'09 - IEEE International Simposium on Information Theory (ISIT), Corée, République De (2007) [hal-00524697 - version 1]

Binary weight distribution of non-binary LDPC codes Andriyanova I. et al Dans Proceeding of the ISIT'09 - IEEE International Symposium on Information Theory : ISIT 2009, Corée, République De (2009) [hal-00524696 - version 1]