Sciweavers

1368 search results - page 153 / 274
» Generalized Rook Polynomials
Sort
View
CORR
2007
Springer
80views Education» more  CORR 2007»
15 years 4 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud
CORR
2007
Springer
78views Education» more  CORR 2007»
15 years 4 months ago
GLRT-Optimal Noncoherent Lattice Decoding
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...
Daniel J. Ryan, Iain B. Collings, I. Vaughan L. Cl...
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 4 months ago
Vector Precoding for Wireless MIMO Systems: A Replica Analysis
We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...
DAM
2007
88views more  DAM 2007»
15 years 4 months ago
Hybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
Jesse D. Bingham, Brad Bingham
131
Voted
ECCC
2007
96views more  ECCC 2007»
15 years 4 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky