Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Capacity Achieving Codes). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Michigan

1. Bae, Jung Hyun. Capacity-Achieving Schemes for Finite-State Channels.

Degree: PhD, Electrical Engineering: Systems, 2011, University of Michigan

 The main goal for the communication engineer is to design the encoder and decoder so that the system can transmit data reliably at the highest… (more)

Subjects/Keywords: Capacity Achieving Codes; Capacity Achieving Schemes; Channels With Memory; Finite-state Channels; Electrical Engineering; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bae, J. H. (2011). Capacity-Achieving Schemes for Finite-State Channels. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/86541

Chicago Manual of Style (16th Edition):

Bae, Jung Hyun. “Capacity-Achieving Schemes for Finite-State Channels.” 2011. Doctoral Dissertation, University of Michigan. Accessed November 25, 2020. http://hdl.handle.net/2027.42/86541.

MLA Handbook (7th Edition):

Bae, Jung Hyun. “Capacity-Achieving Schemes for Finite-State Channels.” 2011. Web. 25 Nov 2020.

Vancouver:

Bae JH. Capacity-Achieving Schemes for Finite-State Channels. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Nov 25]. Available from: http://hdl.handle.net/2027.42/86541.

Council of Science Editors:

Bae JH. Capacity-Achieving Schemes for Finite-State Channels. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/86541


University of Cambridge

2. Greig, Adam. Design Techniques for Efficient Sparse Regression Codes.

Degree: PhD, 2018, University of Cambridge

 Sparse regression codes (SPARCs) are a recently introduced coding scheme for the additive white Gaussian noise channel, for which polynomial time decoding algorithms have been… (more)

Subjects/Keywords: sparse regression codes; information theory; communication; compressed sensing; capacity-achieving codes; multiuser information theory; approximate message passing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Greig, A. (2018). Design Techniques for Efficient Sparse Regression Codes. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/274917

Chicago Manual of Style (16th Edition):

Greig, Adam. “Design Techniques for Efficient Sparse Regression Codes.” 2018. Doctoral Dissertation, University of Cambridge. Accessed November 25, 2020. https://www.repository.cam.ac.uk/handle/1810/274917.

MLA Handbook (7th Edition):

Greig, Adam. “Design Techniques for Efficient Sparse Regression Codes.” 2018. Web. 25 Nov 2020.

Vancouver:

Greig A. Design Techniques for Efficient Sparse Regression Codes. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Nov 25]. Available from: https://www.repository.cam.ac.uk/handle/1810/274917.

Council of Science Editors:

Greig A. Design Techniques for Efficient Sparse Regression Codes. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/274917


University of Cambridge

3. Greig, Adam. Design techniques for efficient sparse regression codes.

Degree: PhD, 2018, University of Cambridge

 Sparse regression codes (SPARCs) are a recently introduced coding scheme for the additive white Gaussian noise channel, for which polynomial time decoding algorithms have been… (more)

Subjects/Keywords: 621.382; sparse regression codes; information theory; communication; compressed sensing; capacity-achieving codes; multiuser information theory; approximate message passing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Greig, A. (2018). Design techniques for efficient sparse regression codes. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.22068 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744693

Chicago Manual of Style (16th Edition):

Greig, Adam. “Design techniques for efficient sparse regression codes.” 2018. Doctoral Dissertation, University of Cambridge. Accessed November 25, 2020. https://doi.org/10.17863/CAM.22068 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744693.

MLA Handbook (7th Edition):

Greig, Adam. “Design techniques for efficient sparse regression codes.” 2018. Web. 25 Nov 2020.

Vancouver:

Greig A. Design techniques for efficient sparse regression codes. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Nov 25]. Available from: https://doi.org/10.17863/CAM.22068 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744693.

Council of Science Editors:

Greig A. Design techniques for efficient sparse regression codes. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.22068 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744693


Penn State University

4. Lu, Min. Low-Density Parity-Check Codes: Asymptotic Behavior and Zeta Functions.

Degree: 2009, Penn State University

 A LDPC code is binary linear code equipped with a sparse parity-check matrix. A bipartite graph, called Tanner graph, can be associated to a parity-check… (more)

Subjects/Keywords: LDPC codes; iterative decoding; pseudo-codewords; capacity-achieving sequences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lu, M. (2009). Low-Density Parity-Check Codes: Asymptotic Behavior and Zeta Functions. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/10088

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lu, Min. “Low-Density Parity-Check Codes: Asymptotic Behavior and Zeta Functions.” 2009. Thesis, Penn State University. Accessed November 25, 2020. https://submit-etda.libraries.psu.edu/catalog/10088.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lu, Min. “Low-Density Parity-Check Codes: Asymptotic Behavior and Zeta Functions.” 2009. Web. 25 Nov 2020.

Vancouver:

Lu M. Low-Density Parity-Check Codes: Asymptotic Behavior and Zeta Functions. [Internet] [Thesis]. Penn State University; 2009. [cited 2020 Nov 25]. Available from: https://submit-etda.libraries.psu.edu/catalog/10088.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lu M. Low-Density Parity-Check Codes: Asymptotic Behavior and Zeta Functions. [Thesis]. Penn State University; 2009. Available from: https://submit-etda.libraries.psu.edu/catalog/10088

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Pontifical Catholic University of Rio de Janeiro

5. MAURO QUILES DE OLIVEIRA LUSTOSA. [en] IRREGULAR REPEAT ACCUMULATE CODES: DESIGN AND EVALUATION.

Degree: 2018, Pontifical Catholic University of Rio de Janeiro

[pt] Os códigos IRA (Irregular Repeat-Accumulate) são uma classe de códigos criada com o objetivo de permitir codificação em tempo linear garantindo comunicação robusta a… (more)

Subjects/Keywords: [pt] CODIGOS LDPC IRREGULARES; [en] IRREGULAR LDPC CODES; [pt] GRAFOS ESPARSOS; [en] SPARSE GRAPHS; [pt] GRAFOS FATORES; [en] FACTOR GRAPHS; [pt] TEORIA DA CODIFICACAO MODERNA; [en] MODERN CODING THEORY; [pt] CAPACIDADE DE ALCANCAR CODIGOS; [en] CAPACITY ACHIEVING CODES

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

LUSTOSA, M. Q. D. O. (2018). [en] IRREGULAR REPEAT ACCUMULATE CODES: DESIGN AND EVALUATION. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32617

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

LUSTOSA, MAURO QUILES DE OLIVEIRA. “[en] IRREGULAR REPEAT ACCUMULATE CODES: DESIGN AND EVALUATION.” 2018. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 25, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

LUSTOSA, MAURO QUILES DE OLIVEIRA. “[en] IRREGULAR REPEAT ACCUMULATE CODES: DESIGN AND EVALUATION.” 2018. Web. 25 Nov 2020.

Vancouver:

LUSTOSA MQDO. [en] IRREGULAR REPEAT ACCUMULATE CODES: DESIGN AND EVALUATION. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. [cited 2020 Nov 25]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

LUSTOSA MQDO. [en] IRREGULAR REPEAT ACCUMULATE CODES: DESIGN AND EVALUATION. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32617

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Michigan

6. Hsu, Chun-Hao. Design and analysis of capacity -achieving codes and optimal receivers with low complexity.

Degree: PhD, Electrical engineering, 2006, University of Michigan

 High performance channel coding schemes for digital communication systems with low computational complexity are considered under two scenarios. Firstly, when the channel is a memoryless… (more)

Subjects/Keywords: Analysis; Capacity-achieving Codes; Complexity; Design; Iterative Decoding; Low-density Parity-check Codes; Optimal Receivers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hsu, C. (2006). Design and analysis of capacity -achieving codes and optimal receivers with low complexity. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/126170

Chicago Manual of Style (16th Edition):

Hsu, Chun-Hao. “Design and analysis of capacity -achieving codes and optimal receivers with low complexity.” 2006. Doctoral Dissertation, University of Michigan. Accessed November 25, 2020. http://hdl.handle.net/2027.42/126170.

MLA Handbook (7th Edition):

Hsu, Chun-Hao. “Design and analysis of capacity -achieving codes and optimal receivers with low complexity.” 2006. Web. 25 Nov 2020.

Vancouver:

Hsu C. Design and analysis of capacity -achieving codes and optimal receivers with low complexity. [Internet] [Doctoral dissertation]. University of Michigan; 2006. [cited 2020 Nov 25]. Available from: http://hdl.handle.net/2027.42/126170.

Council of Science Editors:

Hsu C. Design and analysis of capacity -achieving codes and optimal receivers with low complexity. [Doctoral Dissertation]. University of Michigan; 2006. Available from: http://hdl.handle.net/2027.42/126170

7. Uriarte Toboso, Alain. Optimum Ordering for Coded V-BLAST .

Degree: 2012, University of Ottawa

 The optimum ordering strategies for the coded V-BLAST system with capacity achieving temporal codes on each stream are studied in this thesis. Mathematical representations of… (more)

Subjects/Keywords: MIMO; V-BLAST; Ordering; Waterfilling; Capacity; Detection; Zero-Forcing; capacity achieving temporal codes; IPA; URA; IRA; IPRA; Optimum

…coded V-BLAST the use of capacity achieving temporal codes at each stream allows the per… …BLAST. Given our focus, the use of capacity achieving temporal codes at each stream and… …when capacity achieving temporal codes are used at each stream. 18 3. The V-BLAST… …These streams are then encoded using capacity achieving temporal Gaussian codes and… …is executed without errors. ZF-SIC is assumed for signal detection. Capacity-achieving… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Uriarte Toboso, A. (2012). Optimum Ordering for Coded V-BLAST . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/23509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Uriarte Toboso, Alain. “Optimum Ordering for Coded V-BLAST .” 2012. Thesis, University of Ottawa. Accessed November 25, 2020. http://hdl.handle.net/10393/23509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Uriarte Toboso, Alain. “Optimum Ordering for Coded V-BLAST .” 2012. Web. 25 Nov 2020.

Vancouver:

Uriarte Toboso A. Optimum Ordering for Coded V-BLAST . [Internet] [Thesis]. University of Ottawa; 2012. [cited 2020 Nov 25]. Available from: http://hdl.handle.net/10393/23509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Uriarte Toboso A. Optimum Ordering for Coded V-BLAST . [Thesis]. University of Ottawa; 2012. Available from: http://hdl.handle.net/10393/23509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Nguyen, Phong Sy. Advanced Coding Techniques with Applications to Storage Systems.

Degree: PhD, Electrical Engineering, 2012, Texas A&M University

 This dissertation considers several coding techniques based on Reed-Solomon (RS) and low-density parity-check (LDPC) codes. These two prominent families of error-correcting codes have attracted a… (more)

Subjects/Keywords: coding theory; data storage; Reed-Solomon codes; LDPC codes; ISI channels; soft-decdision decoding; information theory; multiuser communication; capacity achieving codes

…processes. Linear codes are one example of this and they have been shown to achieve the capacity… …A. Background on Reed-Solomon Codes B. Background on LDPC Codes . . . . . 1. Spatially… …Coupled Codes . . . . . a. The (dl , dr , L) Ensemble . . b. The (dl , dr , L, w… …OF REED-SOLOMON CODES . . . . . . 9 A. Introduction… …a. High-Rate Reed-Solomon Codes . . . . . . . . . . . . b. Lower-Rate Reed-Solomon Codes… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nguyen, P. S. (2012). Advanced Coding Techniques with Applications to Storage Systems. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11119

Chicago Manual of Style (16th Edition):

Nguyen, Phong Sy. “Advanced Coding Techniques with Applications to Storage Systems.” 2012. Doctoral Dissertation, Texas A&M University. Accessed November 25, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11119.

MLA Handbook (7th Edition):

Nguyen, Phong Sy. “Advanced Coding Techniques with Applications to Storage Systems.” 2012. Web. 25 Nov 2020.

Vancouver:

Nguyen PS. Advanced Coding Techniques with Applications to Storage Systems. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Nov 25]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11119.

Council of Science Editors:

Nguyen PS. Advanced Coding Techniques with Applications to Storage Systems. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11119

.