• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 31
Next 10 →

On polynomial remainder codes

by Jiun-hung Yu, Hans-andrea Loeliger - IEEE Trans. Information Theory
"... Polynomial remainder codes are a large class of codes derived from the Chinese re-mainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of d ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Polynomial remainder codes are a large class of codes derived from the Chinese re-mainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials

ON CYCLIC PRODUCT CODES

by B. S. Rajan, H. S. Madhusudhana, M. U. Siddiqi
"... It is known that when the blocklengths of two cycljc codes are relatively prime their product code is cyclic when serialized using Chinese Remainder Theorem. When the blocklengths are equal we characterize product codes that are cyclic when serialized either rowwise or columnwise. SUMMARY Given two ..."
Abstract - Add to MetaCart
It is known that when the blocklengths of two cycljc codes are relatively prime their product code is cyclic when serialized using Chinese Remainder Theorem. When the blocklengths are equal we characterize product codes that are cyclic when serialized either rowwise or columnwise. SUMMARY Given two

Self-Dual Codes over Commutative Frobenius Rings

by Steven T. Dougherty, Jon-lark Kim, Hamid Kulosman, Hongwei Liu , 2009
"... We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual code ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self

GAUSSIAN NETWORKS

by J. N. Laneman, V. Gupta Co-director
"... by Utsaw Kumar The presence of inexpensive and powerful sensing and communication devices has made it possible to deploy large scale distributed systems for a variety of applications. Interactions among different components of such a system include communication of information and controlling dynami ..."
Abstract - Add to MetaCart
dynamical processes, among others. Thus, it is important to blend ideas from information theory and control theory to address problems at the core of such distributed systems. This dissertation looks at communication scenarios, in which there are feedback channels available for enhancing communication

1An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder

by Ra Nair, Abbas El Gamal, Yeow-khiang Chia
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

1MIMO Multiway Relaying with Clustered Full Data Exchange: Signal Space Alignment and Degrees of Freedom

by Xiaojun Yuan, M
"... Abstract—We investigate achievable degrees of freedom (DoF) for a multiple-input multiple-output (MIMO) multiway relay channel (mRC) with L clusters andK users per cluster. Each user is equipped with M antennas and the relay with N antennas. We assume a new data exchange model, termed clustered full ..."
Abstract - Add to MetaCart
full data exchange, i.e., each user in a cluster wants to learn the messages of all the other users in the same cluster. Novel signal alignment techniques are developed to systematically construct the beamforming matrices at the users and the relay for efficient physical-layer network coding. Based

05 SIMULTANEOUS CLASSICAL-QUANTUM CAPACITIES OF QUANTUM MULTIPLE ACCESS CHANNELS

by Abbas El Gamal, Carl A. Yard , 2005
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

1MIMO Multiway Relaying with Pairwise Data Exchange: A Degrees of Freedom Perspective

by Rui Wang, Xiaojun Yuan, M
"... Abstract—In this paper, we study achievable degrees of free-dom (DoF) of a multiple-input multiple-output (MIMO) multiway relay channel (mRC) where K users, each equipped with M antennas, exchange messages in a pairwise manner via a common N-antenna relay node. A novel and systematic way of joint be ..."
Abstract - Add to MetaCart
beamforming design at the users and at the relay is proposed to align signals for efficient implementation of physical-layer network coding (PNC). It is shown that, when the user number K = 3, the proposed beamforming design can achieve the DoF capacity of the considered mRC for any (M,N) setups

1 Towards Asymptotic Sum Capacity of MIMO Cellular Two-Way Relay Channel

by Zhaoxi Fang, Xiaojun Yuan, Xin Wang, Senior Member
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

programming

by Silvia Bonettini, Valeria Ruggiero, Federica Tinti
"... the solution of inde nite systems arising in nonlinear ..."
Abstract - Add to MetaCart
the solution of inde nite systems arising in nonlinear
Next 10 →
Results 1 - 10 of 31
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University