IEEE Transactions on Information Theory

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
A generalized uncertainty principle and sparse representation in pairs of bases
IEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2558-2567 - 2002
M. Elad, A.M. Bruckstein
An elementary proof of a basic uncertainty principle concerning pairs of representations of R/sup N/ vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the...... hiện toàn bộ
#Dynamic programming #Minimization methods #Signal representations
A recursive approach to low complexity codes
IEEE Transactions on Information Theory - Tập 27 Số 5 - Trang 533-547 - 1981
R.M. Tanner
Probability of error in MMSE multiuser detection
IEEE Transactions on Information Theory - Tập 43 Số 3 - Trang 858-871 - 1997
H. Vincent Poor, Sergio Verdú
Blind identification and equalization based on second-order statistics: a time domain approach
IEEE Transactions on Information Theory - Tập 40 Số 2 - Trang 340-349 - 1994
Lang Tong, Guanghan Xu, T. Kailath
The hexagon theorem
IEEE Transactions on Information Theory - Tập 28 Số 2 - Trang 137-139 - 1982
Donald J. Newman
On the asymptotic eigenvalue distribution of Toeplitz matrices
IEEE Transactions on Information Theory - Tập 18 Số 6 - Trang 725-730 - 1972
Robert M. Gray
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
IEEE Transactions on Information Theory - Tập 54 Số 6 - Trang 2644-2657 - 2008
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jim, Gregor Leander, Jaume Martí-Farré, Carles Padró
Tailbiting codes obtained via convolutional codes with large active distance-slopes
IEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2577-2587 - 2002
I.E. Bocharova, M. Handlery, R. Johannesson, B.D. Kudryashov
The slope of the active distances is an important parameter when investigating the error-correcting capability of convolutional codes and the distance behavior of concatenated convolutional codes. The slope of the active distances is equal to the minimum average weight cycle in the state-transition diagram of the encoder. A general upper bound on the slope depending on the free distance of the con...... hiện toàn bộ
#Convolutional codes #Error correction coding #Concatenated coding #Search methods
On the effectiveness of receptors in recognition systems
IEEE Transactions on Information Theory - Tập 9 Số 1 - Trang 11-17 - 1963
Thomas Marill, D. Green
Random codes: minimum distances and error exponents
IEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2568-2573 - 2002
A. Barg, G.D. Forney
Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon's random code ensemble and for typical codes from a random linear code ensemble. A typical random code of length N and rate R is shown to have minimum distance N/spl delta//sub GV/(2R), where /spl delta//sub GV/(R) is the Gilbert-Varshamov (GV) relative distan...... hiện toàn bộ
#Linear codes #Channel coding
Tổng số: 213   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10