• arXiv.cs.IT Pub Date : 2020-09-17

One of the major challenges in using distributed learning to train complicated models with large data sets is to deal with stragglers effect. As a solution, coded computation has been recently proposed to efficiently add redundancy to the computation tasks. In this technique, coding is used across data sets, and computation is done over coded data, such that the results of an arbitrary subset of worker

更新日期：2020-09-20
• arXiv.cs.IT Pub Date : 2020-09-17
Sjoerd Dirksen; Alexander Stollenwerk

We consider the problem of encoding a set of vectors into a minimal number of bits while preserving information on their Euclidean geometry. We show that this task can be accomplished by applying a Johnson-Lindenstrauss embedding and subsequently binarizing each vector by comparing each entry of the vector to a uniformly random threshold. Using this simple construction we produce two encodings of a

更新日期：2020-09-20
• arXiv.cs.IT Pub Date : 2020-09-17
Debjit Paria; Krishnakumar; Abhishek Sinha

We consider the online $\textsf{Bipartite Caching}$ problem where $n$ users are connected to $m$ caches in the form of a bipartite network. Each of the $m$ caches has a file storage capacity of $C$. There is a library consisting of $N >C$ distinct files. Each user can request any one of the files from the library at each time slot. We allow the file request sequences to be chosen in an adversarial

更新日期：2020-09-20
• arXiv.cs.IT Pub Date : 2020-09-17
I. Yu. Mogilnykh; F. I. Solov'eva

We continue the study of the class of binary extended perfect propelinear codes constructed in the previous paper and consider their permutation automorphism (symmetry) groups and Steiner quadruple systems. We show that the automorphism group of the SQS of any such code coincides with the permutation automorphism group of the code. In particular, the SQS of these codes are complete invariants for the

更新日期：2020-09-20
• arXiv.cs.IT Pub Date : 2020-09-17
Shuhao Zeng; Hongliang Zhang; Boya Di; Zhu Han; Lingyang Song

Recently, reconfigurable intelligent surfaces (RIS) have attracted a lot of attention due to their capability of extending cell coverage by reflecting signals toward the receiver. In this letter, we analyze the coverage of a downlink RIS-assisted network with one base station (BS) and one user equipment (UE). Since the RIS orientation and the horizontal distance between the RIS and the BS have a significant

更新日期：2020-09-20
• arXiv.cs.IT Pub Date : 2020-09-16
Bilgesu Arif Bilgin; Phillip Stanley-Marbell

Computing systems that can tolerate effects of errors in their communicated data values can trade this tolerance for improved resource efficiency. Many important applications of computing, such as embedded sensor systems, can tolerate errors that are bounded in their distribution of deviation from correctness (distortion). We present a channel adaptation technique which modulates properties of I/O

更新日期：2020-09-20
• arXiv.cs.IT Pub Date : 2020-09-16
Mustafa Emara; Hesham ElSawy; Miltiades C. Filippou; Gerhard Bauch

Multi-access Edge Computing (MEC) enables computation and energy-constrained devices to offload and execute their tasks on powerful servers. Due to the scarce nature of the spectral and computation resources, it is important to jointly consider i) contention-based communications for task offloading and ii) parallel computing and occupation of failure-prone MEC processing resources (virtual machines)

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Yansheng Wu

The hull of a linear code is defined to be the intersection of the code and its dual. When the size of the hull is small, it has been proved that some algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code are very effective in general. Maximum distance separable (MDS) codes are codes meeting the Singleton bound. Twisted Reed-Solomon

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Hong Hu; Yue M. Lu

We prove a universality theorem for learning with random features. Our result shows that, in terms of training and generalization errors, the random feature model with a nonlinear activation function is asymptotically equivalent to a surrogate Gaussian model with a matching covariance matrix. This settles a conjecture based on which several recent papers develop their results. Our method for proving

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Jinglian He; Kaiqiang Yu; Yuanming Shi; Yong Zhou; Wei Chen; Khaled B. Letaief

Antenna selection is capable of reducing the hardware complexity of massive multiple-input multiple-output (MIMO) networks at the cost of certain performance degradation. Reconfigurable intelligent surface (RIS) has emerged as a cost-effective technique that can enhance the spectrum-efficiency of wireless networks by reconfiguring the propagation environment. By employing RIS to compensate the performance

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-15
Lukas Holzbaur; Sven Puchinger; Eitan Yaakobi; Antonia Wachter-Zeh

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes where each local code is a bandwidth-optimal regenerating MDS code. In the event of a node failure, these codes reduce both, the number of servers that have to be contacted as well as the amount of network traffic required

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Qiao Qi; Xiaoming Chen; Caijun Zhong; Zhaoyang Zhang

In this paper, we investigate the issue of integrated sensing, computation and communication (SCC) in beyond fifth-generation (B5G) cellular internet of things (IoT) networks. According to the characteristics of B5G cellular IoT, a comprehensive design framework integrating SCC is put forward for massive IoT. For sensing, highly accurate sensed information at IoT devices are sent to the base station

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Le Yang; Fu-Chun Zheng; Shi Jin

A fine-grained analysis of the cache-enabled networks is crucial for system design. In this paper, we focus on the meta distribution of the signal-to-interference-plus-noise-ratio (SINR) in the mmWave heterogeneous networks where the base stations (BS) in each tier are modeled as Poisson point process (PPP). By utilizing stochastic geometry, we derive the moments of the conditional success probability

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Steven Kisseleff; Eva Lagunas; Tedros Salih Abdu; Symeon Chatzinotas; Björn Ottersten

Next-generation of satellite communication (SatCom) networks are expected to support extremely high data rates for a seamless integration into future large satellite-terrestrial networks. In view of the coming spectral limitations, the main challenge is to reduce the cost per bit, which can only be achieved by enhancing the spectral efficiency. In addition, the capability to quickly and flexibly assign

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Xuemeng Liu; Chang Liu; Yonghui Li; Branka Vucetic; Derrick Wing Kwan Ng

Channel estimation is a challenging problem for realizing efficient ambient backscatter communication (AmBC) systems. In this letter, channel estimation in AmBC is modeled as a denoising problem and a convolutional neural network-based deep residual learning denoiser (CRLD) is developed to directly recover the channel coefficients from the received noisy pilot signals. To simultaneously exploit the

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Yiming Liu; Erwu Liu; Rui Wang

The advantages of millimeter-wave and large antenna arrays technologies for accurate wireless localization received extensive attentions recently. However, how to further improve the accuracy of wireless localization, even in the case of obstructed line-of-sight, is largely undiscovered. In this paper, the reconfigurable intelligent surface (RIS) is introduced into the system to make the positioning

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Wan Jiang; Shixin Zhu; Xiaojing Chen

Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise. Recently, constructing entanglement-assisted quantum maximum distance separable (EAQMDS) codes with flexible parameters has received much attention. In this work, four families of EAQMDS codes with a more general length are presented. And the method

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Pantelimon Stanica; Constanza Riera; Anton Tkachenko

Building upon the observation that the newly defined~\cite{EFRST20} concept of $c$-differential uniformity is not invariant under EA or CCZ-equivalence~\cite{SPRS20}, we showed in~\cite{SG20} that adding some appropriate linearized monomials increases the $c$-differential uniformity of the inverse function, significantly, for some~$c$. We continue that investigation here. First, by analyzing the involved

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Sepehr Dehdashtian; Matin Hashemi; Saber Salehkaleybar

We consider the problem of recovering channel code parameters over a candidate set by merely analyzing the received encoded signals. We propose a deep learning-based solution that I) is capable of identifying the channel code parameters for any coding scheme (such as LDPC, Convolutional, Turbo, and Polar codes), II) is robust against channel impairments like multi-path fading, III) does not require

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16

The attention that deep learning has garnered from the academic community and industry continues to grow year over year, and it has been said that we are in a new golden age of artificial intelligence research. However, neural networks are still often seen as a "black box" where learning occurs but cannot be understood in a human-interpretable way. Since these machine learning systems are increasingly

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-16
Chang Liu; Weijie Yuan; Zhiqiang Wei; Xuemeng Liu; Derrick Wing Kwan Ng

Unmanned aerial vehicle (UAV)-assisted communication becomes a promising technique to realize the beyond fifth generation (5G) wireless networks, due to the high mobility and maneuverability of UAVs which can adapt to heterogeneous requirements of different applications. However, the movement of UAVs impose challenge for accurate beam alignment between the UAV and the ground user equipment (UE). In

更新日期：2020-09-18
• arXiv.cs.IT Pub Date : 2020-09-15
Christof Beierle; Gregor Leander

By applying a recursive tree search, we find many new instances of quadratic APN functions up to CCZ-equivalence. In particular, we present 12,923 new quadratic APN instances in dimension eight and five new quadratic APN instances in dimension ten. The vast majority of those functions have been found by utilizing linear self-equivalences. Among our 8-bit APN functions, there are three extended Walsh

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-15
Trinh Van Chien; Lam Thanh Tu; Symeon Chatzinotas; Björn Ottersten

This paper studies the performance of a single-input single-output (SISO) system enhanced by the assistance of an intelligent reflecting surface (IRS), which is equipped with a finite number of elements under Rayleigh fading channels. From the instantaneous channel capacity, we compute a closed-form expression of the coverage probability as a function of statistical channel information only. A scaling

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-15
Mohamed Akrout; Anis Housseini; Faouzi Bellili; Amine Mezghani

We introduce the bilinear generalized vector approximate message passing (BiG-VAMP) algorithm which jointly recovers two matrices U and V from their noisy product through a probabilistic observation model. BiG-VAMP provides computationally efficient approximate implementations of both max-sum and sumproduct loopy belief propagation (BP). We show how the proposed BiG-VAMP algorithm recovers different

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-15
Nghia Doan; Seyyed Ali Hashemi; Warren Gross

In this paper we address the problem of selecting factor-graph permutations of polar codes under belief propagation (BP) decoding to significantly improve the error-correction performance of the code. In particular, we formalize the factor-graph permutation selection as the multi-armed bandit problem in reinforcement learning and propose a decoder that acts like an online-learning agent that learns

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-15
Matthias Christandl; Alexander Müller-Hermes

Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that these circuits can be implemented using noise-free gates. While this assumption is satisfied for classical machines in many scenarios,

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-15
Arthur J. Parzygnat

We classify the von Neumann entropy as a certain concave functor from finite-dimensional non-commutative probability spaces and state-preserving $*$-homomorphisms to real numbers. This is made precise by first showing that the category of non-commutative probability spaces has the structure of a Grothendieck fibration with a fiberwise convex structure. The entropy difference associated to a $*$-homomorphism

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-15
Sattar Vakili; Kia Khezeli; Victor Picheny

Consider the sequential optimization of an unknown, expensive to evaluate and possibly non-convex objective function $f$ from noisy observations which can be considered as a continuum-armed bandit problem. Bayesian optimization algorithms based on Gaussian Process (GP) models are shown to perform favorably in this setting. In particular, upper bounds are proven on the regret performance of two popular

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-15
Yujie Jin; Hongliang Zhang; Shuhang Zhang; Zhu Han; Lingyang Song

In this letter, we study a buffer-aided Internet of unmanned aerial vehicles (UAVs) in which a UAV performs data sensing, stores the data, and sends it to the base station (BS) in cellular networks. To minimize the overall completion time for all the sensing tasks, we formulate a joint trajectory, sensing location, and sensing time optimization problem. To solve this NP-hard problem efficiently, we

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-14
Yasar Sinan Nasir; Dongning Guo

Deep reinforcement learning offers a model-free alternative to supervised deep learning and classical optimization for solving the transmit power control problem in wireless networks. The multi-agent deep reinforcement learning approach considers each transmitter as an individual learning agent that determines its transmit power level by observing the local wireless environment. Following a certain

更新日期：2020-09-16
• arXiv.cs.IT Pub Date : 2020-09-14
Whan-Hyuk Choi; Jon-Lark Kim

We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the best-known minimum weights of self-dual codes, which have not significantly improved for almost two decades. We focus on a class of self-dual codes, including double

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Haider Al Kim; Sven Puchinger; Antonia Wachter-Zeh

This paper considers coding for so-called partially stuck memory cells. Such memory cells can only store partial information as some of their levels cannot be used due to, e.g., wear out. First, we present a new code construction for masking such partially stuck cells while additionally correcting errors. This construction (for cells with $q >2$ levels) is achieved by generalizing an existing masking-only

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Onel L. A. López; Nurul H. Mahmood; Hirley Alves; Carlos M. Lima; Matti Latva-aho

Channel state information (CSI) has been a key component in traditional wireless communication systems. This might no longer hold in future networks supporting services with stringent quality of service constraints such as extremely low-latency, low-energy and/or large number of simultaneously connected devices, where acquiring CSI would become extremely costly or even impractical. We overview the

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Clement Elvira; Jeremy E. Cohen; Cedric Herzet; Remi Gribonval

In this short paper we bridge two seemingly unrelated sparse approximation topics: continuous sparse coding and low-rank approximations. We show that for a specific choice of continuous dictionary, linear systems with nuclear-norm regularization have the same solutions as a BLasso problem. Although this fact was already partially understood in the matrix case, we further show that for tensor data,

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-09
Nikolaos I. Miridakis; Theodoros A. Tsiftsis; Guanghua Yang

A new spectrum sensing detector is proposed and analytically studied, when it operates under generalized noise channels. Particularly, the McLeish distribution is used to model the underlying noise, which is suitable for both non-Gaussian (impulsive) as well as classical Gaussian noise modeling. The introduced detector adopts a moment-based approach, whereas it is not required to know the transmit

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Daitao Huang; Qin Yue; Yongfeng Niu; Xia Li

Self-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS codes are very important in coding theory and practice. Thus, it is interesting to construct self-dual MDS or self-dual near MDS codes. In this paper, we not only give check matrices of dual codes of twisted generalized Reed-Solomon codes (TGRS codes) but also present the efficient and necessary condition of self-dual

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Yuwei Gao; Jindan Xu; Wei Xu; Derrick Wing Kwan Ng; Mohamed Slim Alouini

Intelligent reflecting surface (IRS) has recently been identified as a prominent technology with the ability of enhancing wireless communication by dynamically manipulating the propagation environment. This paper investigates a multiple-input single-output (MISO) system deploying distributed IRSs. For practical considerations, we propose an efficient design of passive reflecting beamforming for the

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Yang Wu; Weiwei Yang; Xinrong Guan; Qingqing Wu

In this letter, we investigate a UAV-enabled communication system, where a UAV is deployed to communicate with the ground node (GN) in the presence of multiple jammers. We aim to maximize the energy efficiency (EE) of the UAV by optimizing its trajectory, subject to the UAV's mobility constraints. However, the formulated problem is difficult to solve due to the non-convex and fractional form of the

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Qifa Yan; Daniela Tuninetti

This work investigates the problem of cache-aided content Secure and demand Private Linear Function Retrieval (SP-LFR),where three constrains are imposed on the coded caching system: a) each user is interested in retrieving an arbitrary linear combination of the files in the server's library; b) the content of the library must be kept secure from a wiretapper who obtains the signal sent by the server;

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Long Kong; Yun Ai; Lei Lei; Georges Kaddoum; Symeon Chatzinotas; Björn Ottersten

An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance investigations over the classic Alice-Bob-Eve wiretap fading channels is conducted. On the basis of the classic wiretap channel model, we have comprehensively listed and thereafter

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Vahid Jamali; Marzieh Najafi; Robert Schober; H. Vincent Poor

In this paper, we focus on large intelligent reflecting surfaces (IRSs) and propose a new codebook construction method to obtain a set of predesigned phase-shift configurations for the IRS unit cells. Since the overhead for channel estimation and the complexity of online optimization for IRS-assisted communications scale with the size of the phase-shift codebook, the design of small codebooks is of

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Benjamin Chase; Petr Lisonek

The problem of finding APN permutations of ${\mathbb F}_{2^n}$ where $n$ is even and $n>6$ has been called the Big APN Problem. Li, Li, Helleseth and Qu recently characterized APN functions defined on ${\mathbb F}_{q^2}$ of the form $f(x)=x^{3q}+a_1x^{2q+1}+a_2x^{q+2}+a_3x^3$, where $q=2^m$ and $m\ge 4$. We will call functions of this form Kim-type functions because they generalize the form of the

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Ziwen Pan; Ivan B. Djordjevic

Quantum cryptography studies the unconditional information security against an all-powerful eavesdropper in secret key distillation. However the assumption of an omnipotent eavesdropper is too strict for some realistic implementations. In this paper we study the realistic application model of secret key distillation over satellite-to-satellite free space channel in which we impose a reasonable restriction

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Ziwen Pan; Ivan B. Djordjevic

Conventionally, unconditional information security has been studied by quantum cryptography although the assumption of an omnipotent eavesdropper is too strict for some realistic implementations. In this paper, we study the realistic secret key distillation over a satellite-to-satellite free space optics channel where we assume a limited-sized aperture eavesdropper (Eve) in the same plane of the legitimate

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Wanming Hao; Gangcan Sun; Ming Zeng; Zhengyu Zhu; Zheng Chu; Octavia A. Dobre; Pei Xiao

Recently, terahertz (THz) communication has drawn considerable attention as one of the promising technologies for the future wireless communications owning to its ultra-wide bandwidth. Nonetheless, one major obstacle that prevents the actual deployment of THz lies in its inherent huge attenuation. Intelligent reflecting surface (IRS) and multiple-input multiple-output (MIMO) represent two effective

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-12
Felipe S. Abrahão; Klaus Wehmuth; Hector Zenil; Artur Ziviani

Network complexity, network information content analysis, and lossless compressibility of graph representations have been played an important role in network analysis and network modeling. As multidimensional networks, such as time-varying, multilayer, or dynamic multilayer networks, gain more relevancy in network science, it becomes crucial to investigate in which situations universal algorithmic

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-12
Martianus Frederic Ezerman

The article surveys quantum error control, focusing on quantum stabilizer codes, stressing on the how to use classical codes to design good quantum codes. It is to appear as a book chapter in "A Concise Encyclopedia of Coding Theory," edited by C. Huffman, P. Sole and J-L Kim, to be published by CRC Press.

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Chaouki Ben Issaid; Anis Elgabli; Jihong Park; Mehdi Bennis

In this paper, we propose a communication-efficiently decentralized machine learning framework that solves a consensus optimization problem defined over a network of inter-connected workers. The proposed algorithm, Censored-and-Quantized Generalized GADMM (CQ-GGADMM), leverages the novel worker grouping and decentralized learning ideas of Group Alternating Direction Method of Multipliers (GADMM), and

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-11
Venkatesan Guruswami; Andrii Riazanov

The Shannon capacity of a graph is a fundamental quantity in zero-error information theory measuring the rate of growth of independent sets in graph powers. Despite being well-studied, this quantity continues to hold several mysteries. Lov\'asz famously proved that the Shannon capacity of $C_5$ (the 5-cycle) is at most $\sqrt{5}$ via his theta function. This bound is achieved by a simple linear code

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-11
Rahif Kassab; Osvaldo Simeone

This paper introduces Distributed Stein Variational Gradient Descent (DSVGD), a non-parametric generalized Bayesian inference framework for federated learning that enables a flexible trade-off between per-iteration communication load and performance. DSVGD maintains a number of non-random and interacting particles at a central server that represent the current iterate of the model global posterior

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Fang Fang; Kaidi Wang; Zhiguo Ding; Victor C. M. Leung

The combination of non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) can significantly improve the spectrum efficiency beyond the fifth-generation network. In this paper, we mainly focus on energy-efficient resource allocation for a multi-user, multi-BS NOMA assisted MEC network with imperfect channel state information (CSI), in which each user can upload its tasks to multiple base

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-14
Ximing Xie; Fang Fang; Zhiguo Ding

The combination of non-orthogonal multiple access (NOMA) and intelligent reflecting surface (IRS) is an efficient solution to significantly enhance the energy efficiency of the wireless communication system. In this paper, we focus on a downlink multi-cluster NOMA network, where each cluster is supported by one IRS. We aim to minimize the transmit power by jointly optimizing the beamforming, the power

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-11
Fang Fang; Yanqing Xu; Zhiguo Ding; Chao Shen; Mugen Peng; George K. Karagiannidis

Multi-access edge computing (MEC) can enhance the computing capability of mobile devices, while non-orthogonal multiple access (NOMA) can provide high data rates. Combining these two strategies can effectively benefit the network with spectrum and energy efficiency. In this paper, we investigate the task delay minimization in multi-user NOMA-MEC networks, where multiple users can offload their tasks

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Xinran Wang; Yu Xiang; Jun Gao; Jie Ding

In this work, we propose information laundering, a novel framework for enhancing model privacy. Unlike data privacy that concerns the protection of raw data information, model privacy aims to protect an already-learned model that is to be deployed for public use. The private model can be obtained from general learning methods, and its deployment means that it will return a deterministic or random response

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-13
Changyang She; Chengjian Sun; Zhouyou Gu; Yonghui Li; Chenyang Yang; H. Vincent Poor; Branka Vucetic

As one of the key communication scenarios in the 5th and also the 6th generation (6G) cellular networks, ultra-reliable and low-latency communications (URLLC) will be central for the development of various emerging mission-critical applications. The state-of-the-art mobile communication systems do not fulfill the end-to-end delay and overall reliability requirements of URLLC. A holistic framework that

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-12
Subhasis Dasgupta; Amarnath Gupta

Social media data are often modeled as heterogeneous graphs with multiple types of nodes and edges. We present a discovery algorithm that first chooses a "background" graph based on a user's analytical interest and then automatically discovers subgraphs that are structurally and content-wise distinctly different from the background graph. The technique combines the notion of a \texttt{group-by} operation

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-12
Alain Couvreur; Matthieu Lequesne

This article discusses the security of McEliece-like encryption schemes using subspace subcodes of Reed-Solomon codes, i.e. subcodes of Reed-Solomon codes over $\mathbb{F}_{q^m}$ whose entries lie in a fixed collection of $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}$. These codes appear to be a natural generalisation of Goppa and alternant codes and provide a broader flexibility in designing code

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-12
Vukan Ninkovic; Dejan Vukobratovic; Aleksandar Valka; Dejan Dumic

Wi-Fi systems based on the family of IEEE 802.11 standards that operate in unlicenced bands are the most popular wireless interfaces that use Listen Before Talk (LBT) methodology for channel access. Distinctive feature of majority of LBT-based systems is that the transmitters use preambles that precede the data to allow the receivers to acquire initial signal detection and synchronization. The first

更新日期：2020-09-15
• arXiv.cs.IT Pub Date : 2020-09-11
Erika Patricia Dantas de Oliveira Guazzi; Reginaldo Palazzo Junior

In this paper, we present a new approach to the problem of designing hyperbolic signal sets matched to groups by use of Whittaker's proposal in the uniformization of hyperelliptic curves via Fuchsian differential equations (FDEs). This systematic process consists of the steps: 1) Obtaining the genus, g, by embedding a discrete memoryless channel (DMC) on a Riemann surface; 2) Select a set of symmetric

更新日期：2020-09-14
• arXiv.cs.IT Pub Date : 2020-09-11
Shanuja Sasi; B. Sundar Rajan

In this work, we consider a slight variant of well known coded caching problem, referred as multi-access coded caching problem, where each user has access to $z$ neighboring caches in a cyclic wrap-around way. We present a placement and delivery scheme for this problem, under the restriction of uncoded placement. Our work is a generalization of one of the cases considered in "Multi-access coded caching

更新日期：2020-09-14
Contents have been reproduced by permission of the publishers.

down
wechat
bug