• Publications
  • Influence
Distance bounds for algebraic geometric codes
TLDR
We provide short proofs for all floor bounds and most order bounds and formulate the DP and DK order bounds as natural but different generalizations of the Feng-Rao bound for one-point codes. Expand
  • 29
  • 2
  • PDF
Improved Two-Point Codes on Hermitian Curves
  • I. Duursma, R. Kirov
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 10 April 2010
TLDR
An elementary construction of two-point improved codes on the Hermitian curve using one-point divisors. Expand
  • 19
  • 1
  • PDF
An Extension of the Order Bound for AG Codes
TLDR
The most successful method to obtain lower bounds for the minimum distance of an algebraic geometric code is the order bound, which generalizes the Feng-Rao bound. Expand
  • 7
  • PDF
An extension of the order bound for AG codes
TLDR
The most successful method to obtain lower bounds for the minimum distance of an algebraic geometric code is the order bound, which generalizes the Feng-Rao bound. Expand
  • 5
  • PDF
List Coloring And n-Monophilic Graphs
TLDR
We study the smallest number of list-colorings of a graph $G$ among all assignments of lists of a given size $n$ to its vertices. Expand
  • 5
  • PDF
STUDY OF ENAMELED APPLICATIONS FROM AN ANCIENT THRACIAN CHARIOT FROM ASSENOVGRAD, BULGARIA
! Received 17 February 2006 Accepted 12 October 2006
  • 1
  • PDF
Nonbinary Quantum Codes from Two-Point Divisors on Hermitian Curves
TLDR
Sarvepalli and Klappenecker showed how classical one-point codes on the Hermitian curve can be used to construct quantum codes. Expand
DRAFT : List Coloring and n-Monophilic Graphs
In 1990, Kostochka and Sidorenko proposed studying the smallest number of list-colorings of a graph G among all assignments of lists of a given size n to its vertices. We say a graph G isExpand