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: 10-ene-2018



Otros recursos que te pueden interesar

  1. “El cuerpo in-vestido. La función de la vestimenta en las mujeres” .
  2. Multi-stage taxation by subnational governments: Tax incidence and Leviathan taxation This paper analyzes multi-stage taxation by provinces in a federal country, using a novel two-good, ...
  3. Fading out effect or long lasting nudge? The impact of a Conditional Cash Transfer Program beyond starting the school year in Argentina We estimate the impact on education outcomes of the Universal Child Allowance (AUH), a massive condi...
  4. Rutas de influencia: tiempos superpuestos en la obra "Signs and wonder" de Edmund de Waal Se intentará rastrear los diálogos que la obra y los escritos del ceramista Edmund de Waal mantienen...
  5. CO chemisorption on Pt3Sn(111)-p(2x2): a combined HREELS and DFT study

Otros recursos de la mismacolección

  1. Analysis and Optimization of Cooperative Amplify-and-Forward Relaying with Imperfect Channel Estimates Relay-based cooperation promises significant gains in a wireless network as it provides an inde-pend...
  2. Spectrum Sensing in Cognitive Radios using Distributed Sequential Detection Cognitive Radios are emerging communication systems which efficiently utilize the unused licensed ra...
  3. Topics in Network Utility Maximization : Interior Point and Finite-step Methods Network utility maximization has emerged as a powerful tool in studying flow control, resource alloc...
  4. Precoding for Interference Management in Wireless and Wireline Networks Multiple users compete for a common resource like bandwidth to communicate data in interference netw...
  5. Modelling and Performance Analysis of New Coolstreaming for P2P IPTV Peer to peer networks are becoming increasingly popular among Internet users as the downloading peer...

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.