◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Kashyap

4 papers hereh-index 151.1k citations154 works total

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

author position
  • sole author1
  • first author1
  • last author2

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

fields
  • cs.IT3
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20062009
most citedOn the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2007

Matroid Pathwidth and Code Trellis Complexity

Navin Kashyap

We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from…

◍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.