Sciweavers

95 search results - page 3 / 19
» Extendability of Ternary Linear Codes
Sort
View
ACMSE
2005
ACM
13 years 11 months ago
A metaprogramming approach to generating optimized code for algorithms in linear algebra
an extended abstract for a poster that presents a new approach that employs metaprogramming to generate optimized code for algorithms in Linear Algebra. Categories and Subject Des...
Najaf A. Shah, Anthony Skjellum
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 7 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
CORR
2007
Springer
60views Education» more  CORR 2007»
13 years 6 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
DCC
2008
IEEE
14 years 5 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback
The capacity region of the N-sender additive white Gaussian noise (AWGN) multiple access channel (MAC) with feedback is not known in general, despite significant contributions by C...
Ehsan Ardestanizadeh, Michele A. Wigger, Young-Han...