Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
12,932
Locality-constrained linear coding for image classification
- IN: IEEE CONFERENCE ON COMPUTER VISION AND PATTERN CLASSIFICATOIN
, 2010
"... The traditional SPM approach based on bag-of-features (BoF) requires nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effective coding scheme called Locality-constrained Linear Coding (LLC) in place of the VQ coding in traditional SPM. LLC util ..."
Abstract
-
Cited by 443 (20 self)
- Add to MetaCart
The traditional SPM approach based on bag-of-features (BoF) requires nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effective coding scheme called Locality-constrained Linear Coding (LLC) in place of the VQ coding in traditional SPM. LLC
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
- In STOC
, 2005
"... Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli. It can also be viewed as the problem of decoding from a random linear co ..."
Abstract
-
Cited by 364 (6 self)
- Add to MetaCart
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli. It can also be viewed as the problem of decoding from a random linear
ON PERTURBATION OF BINARY LINEAR CODES
, 2015
"... Abstract. We present new codes by perturbation of rows of the generating matrix of a given linear code. Some properties of the perturbed linear codes are given. ..."
Abstract
- Add to MetaCart
Abstract. We present new codes by perturbation of rows of the generating matrix of a given linear code. Some properties of the perturbed linear codes are given.
Using linear programming to decode binary linear codes
- IEEE TRANS. INFORM. THEORY
, 2005
"... A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any discrete memoryless symmetric channel. The decoding algorithm is based on a linear programming (LP) relaxation that is defined by a factor grap ..."
Abstract
-
Cited by 183 (9 self)
- Add to MetaCart
A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any discrete memoryless symmetric channel. The decoding algorithm is based on a linear programming (LP) relaxation that is defined by a factor
Raptor codes
- IEEE Transactions on Information Theory
, 2006
"... LT-Codes are a new class of codes introduced in [1] for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LT-Codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract
-
Cited by 577 (7 self)
- Add to MetaCart
LT-Codes are a new class of codes introduced in [1] for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LT-Codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes
Linear Coding for Network Computing
, 2011
"... We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, and semi-injective target functions. Computing capacity bounds are given with respect to these target functi ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, and semi-injective target functions. Computing capacity bounds are given with respect to these target
Averaging bounds for lattices and linear codes
- IEEE Trans. Information Theory
, 1997
"... Abstract — General random coding theorems for lattices are derived from the Minkowski–Hlawka theorem and their close relation to standard averaging arguments for linear codes over finite fields is pointed out. A new version of the Minkowski–Hlawka theorem itself is obtained as the limit, for p!1,ofa ..."
Abstract
-
Cited by 99 (1 self)
- Add to MetaCart
Abstract — General random coding theorems for lattices are derived from the Minkowski–Hlawka theorem and their close relation to standard averaging arguments for linear codes over finite fields is pointed out. A new version of the Minkowski–Hlawka theorem itself is obtained as the limit, for p!1
THE STRUCTURE OF LINEAR CODES
"... Abstract. In this paper we determine completely the structure of linear codes over Z/N Z of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, ..."
Abstract
- Add to MetaCart
Abstract. In this paper we determine completely the structure of linear codes over Z/N Z of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight
THE STRUCTURE OF LINEAR CODES OF CONSTANT
"... Abstract. In this paper we determine completely the structure of linear codes over Z=NZ of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate func-tionals involved. The weight functions considered are: Hamming weight, ..."
Abstract
- Add to MetaCart
Abstract. In this paper we determine completely the structure of linear codes over Z=NZ of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate func-tionals involved. The weight functions considered are: Hamming weight
Results 1 - 10
of
12,932
