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:
Random codes: minimum distances and error exponents
IEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2568-2573 - 2002
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
On the recovery of a function on a circular domain
IEEE Transactions on Information Theory - Tập 48 Số 10 - Trang 2736-2753 - 2002
We consider the problem of estimating a function f (x, y) on the unit disk f {(x, y): x/sup 2/+y/sup 2//spl les/1}, given a discrete and noisy data recorded on a regular square grid. An estimate of f (x, y) based on a class of orthogonal and complete functions over the unit disk is proposed. This class of functions has a distinctive property of being invariant to rotation of axes about the origin ...... hiện toàn bộ
#Approximation methods #Set theory #Polynomials #Statistics #Number theory
A framework for routing and congestion control for multicast information flows
IEEE Transactions on Information Theory - Tập 48 Số 10 - Trang 2690-2708 - 2002
We propose a new multicast routing and scheduling algorithm called multipurpose multicast routing and scheduling algorithm (MMRS). The routing policy load balances among various possible routes between the source and the destinations, basing its decisions on the message queue lengths at the source node. The scheduling is such that the flow of a session depends on the congestion of the next hop lin...... hiện toàn bộ
#Distributed algorithms #Optimization methods #Delay effects #Queuing analysis #Circuit topology #Packet switching #Traffic control (communication) #Communication system routing
Upper bounds on the rate of LDPC codes
IEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2437-2449 - 2002
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 (1963) bound to a general binary-input symmetric-output channel. We then proceed to derive tighter bounds. We also derive upper bounds on the rate as a function of the minimum distance of the code. We consider both individual codes and ensembles...... hiện toàn bộ
#Codes #Channel coding
More on (2,2)-separating systems
IEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2606-2609 - 2002
The theory of separating systems has been applied in different areas of science and technology such as automata synthesis, technical diagnosis, and authenticating ownership claims. Constructions of (2,2)-separating systems derived from error-correcting codes are given, together with bounds on their parameters based on distance considerations.
#Concatenated coding #Error correction coding #Linear codes
Some Bounds on the Size of Codes
IEEE Transactions on Information Theory - Tập 60 Số 3 - Trang 1475-1480 - 2014
On sampling in shift invariant spaces
IEEE Transactions on Information Theory - Tập 48 Số 10 - Trang 2802-2810 - 2002
A necessary and sufficient condition for sampling in the general framework of shift invariant spaces is derived. Then this result is applied, respectively, to the regular sampling and the perturbation of regular sampling in shift invariant spaces. A simple necessary and sufficient condition for regular sampling in shift invariant spaces is attained. Furthermore, an improved estimate for the pertur...... hiện toàn bộ
#Signal sampling #Signal reconstruction #Spline functions #Wavelet transforms
On the performance of recency-rank and block-sorting universal lossless data compression algorithms
IEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2621-2625 - 2002
Bounds on the redundancy of the recency-rank and block-sorting universal lossless data compression algorithms for finite-length sequences are presented. These algorithms are asymptotically optimal for infinite-length sequences, stationary ergodic sources in the almost-sure sense, and asymptotically mean stationary sources in the average and almost-sure sense.
#Source coding #Redundancy #Sequences
Information capacity of the Hopfield model
IEEE Transactions on Information Theory - Tập 31 Số 4 - Trang 461-464 - 1985
Estimation of the entropy and information of absolutely continuous random variables
IEEE Transactions on Information Theory - Tập 35 Số 1 - Trang 193-196 - 1989
Tổng số: 213
- 1
- 2
- 3
- 4
- 5
- 6
- 10