◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ferruh Özbudak

3 papers here

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

author position
  • first author1
  • last author2

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

fields
  • cs.IT1
  • math.AG1
  • math.ST1
ORCID 0000-0002-1694-9283

identity via Semantic Scholar / OpenAlex

most citedTwo generalizations on the minimum Hamming distance of repeated-root constacyclic codes

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

collaborators
Showing math.AGShow all

1 paper · 1 filter

math.AG2006

Improved asymptotic bounds for codes using distinguished divisors of global function fields

Harald Niederreiter, Ferruh Özbudak

For a prime power q, let αq​ be the standard function in the asymptotic theory of codes, that is, αq​(δ) is the largest asymptotic information rate that can be achieved for a…

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