Academic literature on the topic 'Pseudo-codewords'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Pseudo-codewords.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Pseudo-codewords"

1

Shu-Tao Xia and Fang-Wei Fu. "On the minimum pseudo-codewords of LDPC codes." IEEE Communications Letters 10, no. 5 (2006): 363–65. http://dx.doi.org/10.1109/lcomm.2006.1633324.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Koetter, Ralf, Wen-Ching W. Li, Pascal O. Vontobel, and Judy L. Walker. "Characterizations of pseudo-codewords of (low-density) parity-check codes." Advances in Mathematics 213, no. 1 (2007): 205–29. http://dx.doi.org/10.1016/j.aim.2006.12.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Weigang, Mingzhe Han, Jianting Zhou, et al. "An artificial chromosome for data storage." National Science Review 8, no. 5 (2021). http://dx.doi.org/10.1093/nsr/nwab028.

Full text
Abstract:
Abstract DNA digital storage provides an alternative for information storage with high density and long-term stability. Here, we report the de novo design and synthesis of an artificial chromosome that encodes two pictures and a video clip. The encoding paradigm utilizing the superposition of sparsified error correction codewords and pseudo-random sequences tolerates base insertions/deletions and is well suited to error-prone nanopore sequencing for data retrieval. The entire 254 kb sequence was 95.27% occupied by encoded data. The Transformation-Associated Recombination method was used in the
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Pseudo-codewords"

1

Horn, Gavin B. McEliece Robert J. "Iterative decoding and pseudo-codewords /." Diss., Pasadena, Calif. : California Institute of Technology, 1999. http://resolver.caltech.edu/CaltechETD:etd-02062008-130016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chilappagari, Shashi Kiran. "Analysis of Failures of Decoders for LDPC Codes." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/195483.

Full text
Abstract:
Ever since the publication of Shannon's seminal work in 1948, the search for capacity achieving codes has led to many interesting discoveries in channel coding theory. Low-density parity-check (LDPC) codes originally proposed in 1963 were largely forgotten and rediscovered recently. The significance of LDPC codes lies in their capacity approaching performance even when decoded using low complexity sub-optimal decoding algorithms. Iterative decoders are one such class of decoders that work on a graphical representation of a code known as the Tanner graph. Their properties have been well underst
APA, Harvard, Vancouver, ISO, and other styles
3

Kakakhail, Shahkar. "Prédiction et estimation de très faibles taux d'erreur pour des chaînes de communication codées." Phd thesis, Université de Cergy Pontoise, 2010. http://tel.archives-ouvertes.fr/tel-00819416.

Full text
Abstract:
Dans cette thèse, nous abordons le sujet d'optimisation des méthodes utlisées pour l'évaluation de performance des codes correcteurs d'erreurs. La durée d'une simula- tion Monte Carlo pour estimer le taux d'erreurs dans un système de communication augmente exponentiellement avec l'accroissement du Rapport Signal sur Bruit (RSB). Importance Sampling (IS) est une des techniques qui permettent à réduire le temps de ces simulations. Dans ce travail, on a étudié et mis en oeuvre une version avancée d'IS, appelé Adaptive Importance Sampling (AIS), pour l'évaluation efficace des codes cor- recteurs d'
APA, Harvard, Vancouver, ISO, and other styles
4

Horn, Gavin B. "Iterative decoding and pseudo-codewords." Thesis, 1999. https://thesis.library.caltech.edu/531/1/Horn_gb_1999.pdf.

Full text
Abstract:
In the last six years, we have witnessed an explosion of interest in the coding theory community, in iterative decoding and graphical models, due primarily to the invention of turbo codes. While the structural properties of turbo codes and low density parity check codes have now been put on a firm theoretical footing, what is still lacking is a satisfactory theoretical explanation as to why iterative decoding algorithms perform as well as they do. In this thesis we make a first step by discussing the behavior of various iterative decoders for the graphs of tail-biting codes and cycle codes. By
APA, Harvard, Vancouver, ISO, and other styles
5

Hsu, Wei-yu, and 徐偉峪. "Finding Pseudo-codewords on Computation Tree and Graph-covers." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/61628557325159083614.

Full text
Abstract:
碩士<br>國立中正大學<br>通訊工程研究所<br>94<br>Earlier work of LDPC codes showed that Tanner graph mainly affects the decoding performance of iterative decoding. Pseudo-codewords and pseudo-weights on Tanner graph are found playing an important rule in determining the performance. Computation tree and graph covers are proposed by different researchers to find the pseudo-codewords and pseudo-weights. Definitions of pseudo-codeword using computation tree and graph-cover are somewhat different. Actually, neither computation tree or graph-covers is a good tool to analysis any known codes. In this thesis we will
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Pseudo-codewords"

1

Smarandache, Roxana, and Pascal O. Vontobel. "Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Smarandache, Roxana. "On minimal pseudo-codewords." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xia, Shu-Tao, and Fang-Wei Fu. "Minimum Pseudo-Codewords of LDPC Codes." In 2006 IEEE Information Theory Workshop - ITW '06 Chengdu. IEEE, 2006. http://dx.doi.org/10.1109/itw2.2006.323767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chertkov, Michael, and Mikhail Stepanov. "Searching for low weight pseudo-codewords." In 2007 Information Theory and Applications Workshop. IEEE, 2007. http://dx.doi.org/10.1109/ita.2007.4357567.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Smarandache, Roxana, Ali Pusane, Pascal Vontobel, and Daniel Costello. "Pseudo-Codewords in LDPC Convolutional Codes." In 2006 IEEE International Symposium on Information Theory. IEEE, 2006. http://dx.doi.org/10.1109/isit.2006.262069.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vontobel, P. O., R. Smarandache, N. Kiyavash, J. Teutsch, and D. Vukobratovic. "On the minimal pseudo-codewords of codes from finite geometries." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523484.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Matsuda, Shuzo, Seiken Saito, and Toyokazu Hiramatsu. "Computation of zeta functions counting pseudo-codewords of linear codes." In 2008 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2008. http://dx.doi.org/10.1109/isita.2008.4895507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chertkov, Michael, and Mikhail Stepanov. "Polytope of correct (linear programming) decoding and low-weight pseudo-codewords." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6033824.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rosnes, Eirik. "On the Effects of Pseudo-Codewords on Independent Rayleigh Flat-Fading Channels." In 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks. IEEE, 2007. http://dx.doi.org/10.1109/itwitwn.2007.4318057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!