Upper bounds on the rate of LDPC codes as a function of minimum distance”, submitted to (2008)
Abstract — New upper bounds on the rate of low-density paritycheck (LDPC) codes as a function of the minimum distance of the code are derived. These bounds are based on combinatorial arguments and...
Exact minimum density of codes identifying vertices in the square grid (2008)
Abstract. An identifying code C is a subset of the vertices of the square grid Z 2 with the property that for each element v of Z 2, the collection of elements from C at a distance of at most one...
Bounds for Codes in Products of Spaces, Grassmann and Stiefel Manifolds (2008)
Christine Bachoc, Yael Ben-haim, Simon Litsyn, Senior Member
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and projective spaces....
Bounds for codes in products of spaces, Grassmann and Stiefel manifolds (2006)
Bachoc, Christine, Ben-Haim, Yael, Litsyn, Simon
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The...
Ben-Haim, Yael, Zicherman-Keren, Maya, Rosenberg, Eugene
Coral bleaching is the disruption of symbioses between coral animals and their photosynthetic microalgal endosymbionts (zooxanthellae). It has been suggested that large-scale bleaching episodes are...
Ben-Haim, Yael, Zicherman-Keren, Maya, Rosenberg, Eugene
Coral bleaching is the disruption of symbioses between coral animals and their photosynthetic microalgal endosymbionts (zooxanthellae). It has been suggested that large-scale bleaching episodes are...