◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sanjay Karmakar

2 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.IT2

identity via Semantic Scholar / OpenAlex

most citedHigh-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras

9 citations · 17 across the 2 of their papers we have counts for

collaborators

2 papers

cs.IT2007★ 8 cited

Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras

Sanjay Karmakar, B. Sundar Rajan

It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matr…

cs.IT2007★ 9 cited

High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras

Sanjay Karmakar, B. Sundar Rajan

It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are single-symbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-sy…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.