Sciweavers

112 search results - page 7 / 23
» Low Density Lattice Codes
Sort
View
XPU
2007
Springer
14 years 1 months ago
Predicting Software Defect Density: A Case Study on Automated Static Code Analysis
The number of defects is an important indicator of software quality. Agile software development methods put an explicit requirement on automation and permanently low defect rates. ...
Artem Marchenko, Pekka Abrahamsson
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 7 months ago
Cooperative Lattice Coding and Decoding
We propose novel lattice coding/decoding schemes for half-duplex outage-limited cooperative channels. These schemes are inspired by the cooperation protocols of Azarian et al. and ...
Arul D. Murugan, Kambiz Azarian, Hesham El Gamal
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
14 years 4 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
GLOBECOM
2008
IEEE
14 years 1 months ago
Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
Luay Azzam, Ender Ayanoglu
TIT
2002
89views more  TIT 2002»
13 years 7 months ago
Upper bounds on the rate of LDPC Codes
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
David Burshtein, Michael Krivelevich, Simon Litsyn...