1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia

Opción 1: Descargar recurso

Opción 2: Descargar recurso

Detalles del recurso


The classical binary error correcting codes, and subspace codes for error correction in random network coding are two different forms of error control coding. We identify common features between these two forms and study the relations between them using the aid of lattices. Lattices are partial ordered sets where every pair of elements has a least upper bound and a greatest lower bound in the lattice. We shall demonstrate that many questions that connect these forms have a natural motivation from the viewpoint of lattices. We shall show that a lattice framework captures the notion of Singleton bound where the bound is on the size of the code as a function of its parameters. For the most part, we consider a special type of a lattice which has the geometric modular property. We will use a lattice framework to combine the two different forms. And then, in order to demonstrate the utility of this binding view, we shall derive a general version of Singleton bound. We will note that the Singleton bounds behave differently in certain respects because the binary coding framework is associated with a lattice that is distributive. We shall demonstrate that lack of distributive gives rise to a weaker bound. We show that Singleton bound for classical binary codes, subspace codes, rank metric codes and Ferrers diagram rank metric codes can be derived using a common technique. In the literature, Singleton bounds are derived for Ferrers diagram rank metric codes where the rank metric codes are linear. We introduce a generalized version of Ferrers diagram rank metric codes and obtain a Singleton bound for this version. Next, we shall prove a conjecture concerning the constraints of embedding a binary coding framework into a subspace framework. We shall prove a conjecture by Braun, Etzion and Vardy, which states that any such embedding which contains the full space in its range is constrained to have a particular size. Our proof will use a theorem due to Lovasz, a subspace counting theorem for geometric modular lattices, to prove the conjecture. We shall further demonstrate that any code that achieves the conjectured size must be of a particular type. This particular type turns out to be a natural distributive sub-lattice of a given geometric modular lattice.

Pertenece a

ETD at Indian Institute of Science  


Pai, Srikanth B - 

Id.: 70129728

Idioma: inglés (Estados Unidos)  - 

Versión: 1.0

Estado: Final

Palabras claveLattice Coding - 

Tipo de recurso: Thesis  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Requerimientos técnicos:  Browser: Any - 

Relación: [References] G27803

Fecha de contribución: 11-oct-2017



Otros recursos que te pueden interesar

  1. CIL 9.5438 – Record of ‘collegia’ who helped fund the repaving of the cattle market in Falerio Squeeze and photograph
  2. T-type calcium channels in rat carotid body chemoreceptor cells. Molecular and functional hallmarks Resumen del póster presentado al 14th International Meeting of the European Calcium Society, celebra...
  3. Orai1 and Stim1 downregulation mediates the loss of store-operated Ca2+ entry in rat hippocampal neurons aged in vitro Resumen del póster presentado al 14th International Meeting of the European Calcium Society, celebra...
  4. Aging and amyloid β oligomers enhance TLR4 expression and are required for LPS-induced Ca2+ responses and neuron cell death in rat hippocampal neurons Resumen del póster presentado al 14th International Meeting of the European Calcium Society, celebra...
  5. In vivo Ca2+ imaging in the endoplasmic reticulum with GAP sensors Resumen del trabajo presentado al 14th International Meeting of the European Calcium Society, celebr...

Otros recursos de la mismacolección

  1. Integrated Interfaces for Sensing Applications Sensor interfaces are needed to communicate the measured real-world analog values to the base¬band d...
  2. Network Coding for Wirless Relaying and Wireline Networks Network coding has emerged as an attractive alternative to routing because of the through put improv...
  3. Timbre Perception of Time-Varying Signals Every auditory event provides an information-rich signal to the brain. The signal constitutes percep...
  4. Packet Scheduling on the Wireless Channel Scheduling has always been an indispensable part of resource allocation in wireless networks. Accura...
  5. Photonic Crystal Ring Resonators for Optical Networking and Sensing Applications Photonic bandgap structures have provided promising platform for miniaturization of modern integrate...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.