Search
Selected: T

The approximate maximum-likelihood certificate

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Arbitrarily Varying Multiple-Access Channel with Conferencing Encoders

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Asymptotic Limits of Interference in Multicell Networks with Channel Aware Scheduling

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Asymptotic Normalized Linear Complexity of Multisequences

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The asymptotic number of binary codes and binary matroids

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The automorphism group of a self-dual binary [72,36,16] code does not contain Z7, Z3xZ3, or D10

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Automorphism Group of an Extremal [72,36,16] Code does not contain elements of order 6

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The AWGN Red Alert Problem

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Battery-Discharge-Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Benefit of Thresholding in LP Decoding of LDPC Codes

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Berlekamp-Massey Algorithm via Minimal Polynomials

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The best possible upper bound on the probability of undetected error for linear codes of full support

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Bethe Permanent of a Non-Negative Matrix

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Binary-Symmetric Parallel-Relay Network

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Burbea-Rao and Bhattacharyya centroids

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The capacity for the linear time-invariant Gaussian relay channel

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The capacity of a class of 3-receiver broadcast channels with degraded message sets

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.