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 +publisher:"University of Colorado" +contributor:("Mahesh Varanasi"). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Colorado

1. Limburg, Steve. Space-time Codes, Non-associative Division Algebras, and Elliptic Curves.

Degree: PhD, Mathematics, 2012, University of Colorado

  Space-time codes are used to reliably send data from multiple transmit antennas and are directly related to non-associative division algebras. While interested in classifying… (more)

Subjects/Keywords: 4-isogeny; division algebra; elliptic curves; non-associative algebra; space-time codes; Algebra; Mathematics; Systems and Communications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Limburg, S. (2012). Space-time Codes, Non-associative Division Algebras, and Elliptic Curves. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/11

Chicago Manual of Style (16th Edition):

Limburg, Steve. “Space-time Codes, Non-associative Division Algebras, and Elliptic Curves.” 2012. Doctoral Dissertation, University of Colorado. Accessed January 18, 2021. https://scholar.colorado.edu/math_gradetds/11.

MLA Handbook (7th Edition):

Limburg, Steve. “Space-time Codes, Non-associative Division Algebras, and Elliptic Curves.” 2012. Web. 18 Jan 2021.

Vancouver:

Limburg S. Space-time Codes, Non-associative Division Algebras, and Elliptic Curves. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2021 Jan 18]. Available from: https://scholar.colorado.edu/math_gradetds/11.

Council of Science Editors:

Limburg S. Space-time Codes, Non-associative Division Algebras, and Elliptic Curves. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/math_gradetds/11


University of Colorado

2. Pang, Yimin. Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom.

Degree: PhD, 2019, University of Colorado

  Spectrum sharing allows the coexistence of heterogeneous wireless networks on the same frequency band. Managing the interference between such networks is critically important to… (more)

Subjects/Keywords: generalized degrees of freedom; ic-zic; interference channel; mac-ic-mac; mimo; one-to-three; Electrical and Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pang, Y. (2019). Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/eeng_gradetds/39

Chicago Manual of Style (16th Edition):

Pang, Yimin. “Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom.” 2019. Doctoral Dissertation, University of Colorado. Accessed January 18, 2021. https://scholar.colorado.edu/eeng_gradetds/39.

MLA Handbook (7th Edition):

Pang, Yimin. “Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom.” 2019. Web. 18 Jan 2021.

Vancouver:

Pang Y. Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom. [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2021 Jan 18]. Available from: https://scholar.colorado.edu/eeng_gradetds/39.

Council of Science Editors:

Pang Y. Capacity Approximations of Mimo Interference Channels: Beyond Degrees of Freedom. [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/eeng_gradetds/39


University of Colorado

3. Romero, Henry Paul. Fundamental Limits of Network Communication with General Message Sets: A Combinatorial Approach.

Degree: PhD, Applied Mathematics, 2014, University of Colorado

  The classical theoretical framework for communication networks is based on the simplifying assumption that each message to be sent is known to a single… (more)

Subjects/Keywords: Information Theory; DM Multiple Access Channel; MIMO Multiple Access Channel; Broadcast Channel; Inteference Channel; Computer Sciences; Electrical and Computer Engineering; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Romero, H. P. (2014). Fundamental Limits of Network Communication with General Message Sets: A Combinatorial Approach. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/61

Chicago Manual of Style (16th Edition):

Romero, Henry Paul. “Fundamental Limits of Network Communication with General Message Sets: A Combinatorial Approach.” 2014. Doctoral Dissertation, University of Colorado. Accessed January 18, 2021. https://scholar.colorado.edu/appm_gradetds/61.

MLA Handbook (7th Edition):

Romero, Henry Paul. “Fundamental Limits of Network Communication with General Message Sets: A Combinatorial Approach.” 2014. Web. 18 Jan 2021.

Vancouver:

Romero HP. Fundamental Limits of Network Communication with General Message Sets: A Combinatorial Approach. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2021 Jan 18]. Available from: https://scholar.colorado.edu/appm_gradetds/61.

Council of Science Editors:

Romero HP. Fundamental Limits of Network Communication with General Message Sets: A Combinatorial Approach. [Doctoral Dissertation]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/appm_gradetds/61


University of Colorado

4. Keyes, David Parker. Analytic Proofs of Certain MacWilliams Identities.

Degree: PhD, Mathematics, 2011, University of Colorado

Subjects/Keywords: Codes; MacWilliams Identities; Modular Forms; Theta Functions; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keyes, D. P. (2011). Analytic Proofs of Certain MacWilliams Identities. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/10

Chicago Manual of Style (16th Edition):

Keyes, David Parker. “Analytic Proofs of Certain MacWilliams Identities.” 2011. Doctoral Dissertation, University of Colorado. Accessed January 18, 2021. https://scholar.colorado.edu/math_gradetds/10.

MLA Handbook (7th Edition):

Keyes, David Parker. “Analytic Proofs of Certain MacWilliams Identities.” 2011. Web. 18 Jan 2021.

Vancouver:

Keyes DP. Analytic Proofs of Certain MacWilliams Identities. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2021 Jan 18]. Available from: https://scholar.colorado.edu/math_gradetds/10.

Council of Science Editors:

Keyes DP. Analytic Proofs of Certain MacWilliams Identities. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/math_gradetds/10

.