Sciweavers

123
Voted
TCS
2016
9 years 11 months ago
Computational complexity of covering three-vertex multigraphs
Abstract. A covering projection from a graph G to a graph H is a mapping of the vertices of G to the vertices of H such that, for every vertex v of G, the neighborhood of v is mapp...
Jan Kratochvíl, Jan Arne Telle, Marek Tesar
124
Voted
TCS
2016
9 years 11 months ago
Gray coding cubic planar maps
Abstract. The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, w...
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N...
102
Voted
TCOM
2016
9 years 11 months ago
RS-LDPC Concatenated Coding for the Modern Tape Storage Channel
—In modern tape storage, user data are recorded and retrieved along multiple tracks of rapidly moving, flexible magnetic medium that give rise to a variety of channel impediment...
Jieun Oh, Jeongseok Ha, Hyegyeong Park, Jaekyun Mo...
113
Voted
TCOM
2016
9 years 11 months ago
16-QAM Almost-Complementary Sequences With Low PMEPR
A pair of sequences is said to be an almost-complementary pair (ACP) if they have zero aperiodic autocorrelation sums except at only one position over all the positive/negative ti...
Zi Long Liu, Yong Liang Guan
126
Voted
TCOM
2016
9 years 11 months ago
Optimal Power Allocation for Maximum Throughput of General MU-MIMO Multiple Access Channels With Mixed Constraints
—Based on the efficient Generalized Water-Filling with Group peak Power constraints (GWFGP), this paper proposed an iterative algorithm to compute the optimal solutions to syste...
Peter He, Lian Zhao
114
Voted
TCOM
2016
9 years 11 months ago
Hamming Distance Spectrum of DAC Codes for Equiprobable Binary Sources
—Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (SWC). It has been shown that a DAC code partitions source space into unequals...
Yong Fang, Vladimir Stankovic, Samuel Cheng, En-Hu...
104
Voted
TCOM
2016
9 years 11 months ago
Optimal Resource Allocation for Buffer-Aided Relaying With Statistical QoS Constraint
—We consider a 3-node buffer-aided relaying network with statistical quality-of-service (QoS) constraint in terms of maximum acceptable end-to-end queue-length bound outage proba...
Khoa Tran Phan, Tho Le-Ngoc, Long Bao Le
TCOM
2016
9 years 11 months ago
Performance Analysis of Raptor Codes Under Maximum Likelihood Decoding
—In this paper, we analyze the maximum likelihood decoding performance of Raptor codes with a systematic lowdensity generator-matrix code as the pre-code. By investigating the ra...
Peng Wang, Guoqiang Mao, Zihuai Lin, Ming Ding, We...
95
Voted
TCOM
2016
9 years 11 months ago
Breaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding
—Trapping sets strongly degrade performance of low-density parity check (LDPC) codes in the low-error-rate region. This creates significant difficulties for the deployment of L...
Soonyoung Kang, Jaekyun Moon, Jeongseok Ha, Jinwoo...