◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Eleonora Guerrini

14 papers hereh-index 8181 citations27 works total

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

author position
  • first author6
  • middle author7

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

fields
  • cs.IT10
  • cs.DM2
  • cs.SC2

identity via Semantic Scholar / OpenAlex

activity
20092026
most citedExtremal graphs for the identifying code problem

40 citations · 53 across the 12 of their papers we have counts for

collaborators
Showing 2009Show all

2 papers · 1 filter

cs.DM2009

Computing the distance distribution of systematic non-linear codes

Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala

The most important families of non-linear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the…

cs.IT2009★ 1 cited

A bound on the size of linear codes

Eleonora Guerrini, Massimiliano Sala

We present a bound on the size of linear codes. This bound is independent of other known bounds, e.g. the Griesmer bound.

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