Sciweavers

3373 search results - page 73 / 675
» Linear transformations on codes
Sort
View
OL
2011
217views Neural Networks» more  OL 2011»
14 years 4 months ago
Privacy-preserving linear programming
Abstract. We propose a privacy-preserving formulation of a linear program whose constraint matrix is partitioned into groups of columns where each group of columns and its correspo...
O. L. Mangasarian
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 4 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
ICC
2008
IEEE
102views Communications» more  ICC 2008»
15 years 4 months ago
Geometric Random Linear Codes in Sensor Networks
—Wireless sensor networks consist of unreliable and energy-constrained sensors connecting to each other wirelessly. As measured data may be lost due to sensor failures, maintaini...
Yunfeng Lin, Ben Liang, Baochun Li
DCC
2008
IEEE
15 years 9 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
ECCC
2007
96views more  ECCC 2007»
14 years 9 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky