default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDB. A. Sethuraman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j7]Anne-Maria Ernvall-Hytönen, B. A. Sethuraman
:
Counterexample to the Generalized Belfiore-Solé Secrecy Function Conjecture for l-Modular Lattices. IEEE Trans. Inf. Theory 62(8): 4514-4522 (2016)- 2015
- [j6]Grégory Berhuy, Nadya Markin, B. A. Sethuraman:
Bounds on Fast Decodability of Space-Time Block Codes, Skew-Hermitian Matrices, and Azumaya Algebras. IEEE Trans. Inf. Theory 61(4): 1959-1970 (2015) - [c11]Anne-Maria Ernvall-Hytönen, B. A. Sethuraman:
Counterexample to the generalized belfiore-solé secrecy function conjecture for l-modular lattices. ISIT 2015: 2466-2469 - 2014
- [c10]Grégory Berhuy, Nadya Markin, B. A. Sethuraman:
Fast lattice decodability of space-time block codes. ISIT 2014: 1917-1921 - [c9]Julia Pinchak, B. A. Sethuraman:
The Belfiore-Sole conjecture and a certain technique for verifying it for a given lattice. ITA 2014: 1-3 - [i5]Grégory Berhuy, Nadya Markin, B. A. Sethuraman:
Bounds of fast decodability of space time block codes, skew-Hermitian matrices, and Azumaya algebras. CoRR abs/1405.5966 (2014) - [i4]Anne-Maria Ernvall-Hytönen, B. A. Sethuraman:
Counterexample to the $l$-modular Belfiore-Solé Conjecture. CoRR abs/1409.3188 (2014) - 2013
- [j5]Frédérique E. Oggier, Bharat Al Sethuraman:
Quotients of orders in cyclic algebras and space-time codes. Adv. Math. Commun. 7(4): 441-461 (2013) - 2012
- [i3]Frédérique E. Oggier, B. A. Sethuraman:
Quotients of Orders in Cyclic Algebras and Space-Time Codes. CoRR abs/1210.7044 (2012)
2000 – 2009
- 2009
- [j4]Sameer A. Pawar, K. Raj Kumar, Petros Elia, P. Vijay Kumar, B. A. Sethuraman:
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. IEEE Trans. Inf. Theory 55(7): 3101-3114 (2009) - [i2]B. A. Sethuraman:
Division Algebras and Wireless Communication. CoRR abs/0906.0997 (2009) - 2007
- [j3]Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes for Any Number of Antennas. IEEE Trans. Inf. Theory 53(11): 3853-3868 (2007) - [c8]B. A. Sethuraman, Frédérique E. Oggier:
Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields. AAECC 2007: 138-147 - 2006
- [j2]Vummintala Shashidhar, B. Sundar Rajan, B. A. Sethuraman:
Information-Lossless Space-Time Block Codes From Crossed-Product Algebras. IEEE Trans. Inf. Theory 52(9): 3913-3935 (2006) - 2005
- [c7]Sameer A. Pawar, K. Raj Kumar, P. Vijay Kumar, Petros Elia, B. A. Sethuraman:
Achieving the DMD tradeoff of the MIMO-ARQ channel. ISIT 2005: 901-905 - [i1]Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas. CoRR abs/cs/0512023 (2005) - 2004
- [c6]Vummintala Shashidhar, B. Sundar Rajan, Bharat Al Sethuraman:
STBCs using capacity achieving designs from crossed-product division algebras. ICC 2004: 827-831 - [c5]Vummintala Shashidhar, B. Sundar Rajan, B. A. Sethuraman:
Information-lossless STBCs from crossed-product algebras. ISIT 2004: 126 - 2003
- [j1]B. A. Sethuraman, B. Sundar Rajan, Vummintala Shashidhar:
Full-diversity, high-rate space-time block codes from division algebras. IEEE Trans. Inf. Theory 49(10): 2596-2616 (2003) - [c4]Vummintala Shashidhar, B. Sundar Rajan, B. A. Sethuraman:
STBCs using capacity achieving designs from cyclic division algebras. GLOBECOM 2003: 1957-1962 - 2002
- [c3]B. A. Sethuraman, B. Sundar Rajan:
An algebraic description of orthogonal designs and the uniqueness of the Alamouti code. GLOBECOM 2002: 1088-1092 - [c2]B. A. Sethuraman, B. Sundar Rajan:
Optimal STBC over PSK signal sets from cyclotomic field extensions. ICC 2002: 1783-1787 - [c1]B. A. Sethuraman, B. Sundar Rajan:
Full-rank, full-rate STBCs from division algebras. ITW 2002: 69-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
