We treat the problem of bounding components of the possible distance distributions of codes given the knowledge of their size and, perhaps, minimum distance.
We consider the problem of minimizing the amount of deployed fiber in optical networks in which each fiber carries a fixed number of wavelengths.
Iterated localization is considered where each node of a network needs to get localized (find its location on 2D plane), when initially only a subset of nodes have their location information.
We derive the Gilbert-Varshamov and Hamming bounds for packings of spheres (codes) in the Grassmann manifolds over R and C.
We derive the Varshamov-Gilbert and Hamming bounds for packings of spheres (codes) in the Grassmann manifolds over R and C.
Any estimator which is constrained to take values in a finite range is, in general, biased.
Asymptotically bounding the covering radius in terms of the dual distance is a wellstudied problem.
We study the second-order coding rate of the multiple-input multiple-output (MIMO) Rayleigh block-fading channel via statistical bounds from information spectrum methods and random matrix theory.
Hornreich et al. predicted that Blue Phase I, II or III should undergo structural transformations into anisotropic uniaxial Blue Phases in electric or magnetic fields.
The evolution towards virtualized network functions (VNFs) is expected to enable service agility within the telecommunications industry.
