#### Brunel University Research Archive(BURA) preserves and enables easy and open access to all

types of digital content. It showcases Brunel's research outputs.

Research contained within BURA is open access, although some publications may be subject

to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.

##
Browsing by Author Krasikov, I

Showing results 1 to 15 of 15

Issue Date | Title | Author(s) |

1994 | Applications of balance equations to vertex switching reconstruction | *Krasikov, I* |

1994 | Bounds for the harmonious chromatic number of a graph | *Krasikov, I; Roditty, Y* |

2016 | Elements of PÓlya-schur theory in the finite difference setting | *Brändén, P; Krasikov, I; Shapiro, B* |

1997 | Estimates for the range of binomiality in codes' spectra | *Krasikov, I; Litsyn, S* |

2004 | Finding next-to-shortest paths in a graph | *Krasikov, I; Noble, S D* |

2004 | Growing random sequences | *Krasikov, I; Rodgers, GJ; Tripp, CE* |

2000 | An improved upper bound on the minimum distance of doubly-even self-dual codes | *Krasikov, I; Litsyn, S* |

2012 | Integral zeroes of Krawtchouk polynomials | *Alenezi, Ahmad M* |

1997 | Linear programming bounds for doubly-even self-dual codes | *Krasikov, I* |

2017 | On approximation of ultraspherical polynomials in the oscillatory region | *Krasikov, I* |

1995 | On spectra of BCH codes | *Krasikov, I; Litsyn, S* |

1995 | On the accuracy of the binomial approximation to the distance distribution of codes | *Krasikov, I; Litsyn, S* |

2014 | On the Bessel function Jv(x) in the transition region | *Krasikov, I* |

1999 | On the distance distribution of duals of BCH codes | *Krasikov, I* |

1991 | On the largest tree of given maximum degree in a connected graph | *Caro, Y; Krasikov, I; Roditty, Y* |