Sciweavers

498 search results - page 32 / 100
» New Constructions for IPP Codes
Sort
View
APN
2006
Springer
15 years 3 months ago
Invariant Based Programming
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
Ralph-Johan Back
DCC
2006
IEEE
16 years 1 months ago
Applications of representation theory to wireless communications
In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space-time codes for use in multiple antenna wireless ...
Ali Miri, Monica Nevins, Terasan Niyomsataya
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 2 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
CORR
2007
Springer
60views Education» more  CORR 2007»
15 years 1 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
GLOBECOM
2006
IEEE
15 years 8 months ago
Scalable Design of Space-Time Trellis Code with Low Decoding Complexity
—Design of space-time codes that scale with the number of transmit antennas is a difficult problem. In this paper, we introduce a new family of space-time trellis codes (STTC) th...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...