Sciweavers

1579 search results - page 73 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
CORR
2007
Springer
138views Education» more  CORR 2007»
14 years 9 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan
DCC
2005
IEEE
15 years 9 months ago
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
Pascale Charpin, Enes Pasalic
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 10 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...
GLOBECOM
2006
IEEE
15 years 3 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...
CORR
2007
Springer
134views Education» more  CORR 2007»
14 years 9 months ago
On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan