相关论文: Frame Codes for the Block-Erasure Channel -- Exten…

We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission to the receiver over a packet erasure link. Each message must subsequently be decoded at the receiver within a…

Small neural networks (NNs) used for error correction were shown to improve on classic channel codes and to address channel model changes. We extend the code dimension of any such structure by using the same NN under one-hot encoding…

Code-domain non-orthogonal multiple access (CD-NOMA) systems offer key benefits such as high spectral efficiency, low latency, high reliability, and massive connectivity. NOMA's ability to handle overloading allows multiple devices to share…

This paper proposes a new scheme to enhance the secrecy performance of a NOMA-based coordinated direct relay transmission system (NOMA-CDRT) with an untrusted relay. The physical-layer network coding and the non-orthogonal multiple access…

For any $n_t$ transmit, $n_r$ receive antenna ($n_t\times n_r$) MIMO system in a quasi-static Rayleigh fading environment, it was shown by Elia et al. that linear space-time block code-schemes (LSTBC-schemes) which have the non-vanishing…

Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to…

Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead…

Erasure list decoding was introduced to correct a larger number of erasures with output of a list of possible candidates. In the present paper, we consider both random linear codes and algebraic geometry codes for list decoding erasure…

The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the…

We consider the following generalization of an $(n,k)$ MDS code for application to an erasure channel with additive noise. Like an MDS code, our code is required to be decodable from any $k$ received symbols, in the absence of noise. In…

Spin-torque transfer magnetic random access memory (STT-MRAM) is a promising emerging non-volatile memory (NVM) technology with wide applications. However, the data recovery of STT-MRAM is affected by the diversity of channel raw bit error…

This paper presents a novel spectral algorithm with additive clustering designed to identify overlapping communities in networks. The algorithm is based on geometric properties of the spectrum of the expected adjacency matrix in a random…

In this paper, we introduce Random Erasing, a new data augmentation method for training the convolutional neural network (CNN). In training, Random Erasing randomly selects a rectangle region in an image and erases its pixels with random…

Function-Correcting Codes (FCCs) enable reliable computation of a function of a $k$-bit message over noisy channels without requiring full message recovery. In this work, we study optimal single-error correcting FCCs (SEFCCs) for…

This paper introduces a new and unified bit error rates performance analysis of space-time block codes (STBC) deployed in wireless systems with spatial diversity in generalized shadowed fading and noise scenarios. Specifically, we derive a…

The effect of different spreading codes in DWT based MC-CDMA wireless communication system is investigated. In this paper, we present the Bit Error Rate (BER) performance of different spreading codes (Walsh-Hadamard code, Orthogonal gold…

Finite mixture modelling is a popular method in the field of clustering and is beneficial largely due to its soft cluster membership probabilities. A common method for fitting finite mixture models is to employ spectral clustering, which…

We discuss how subspace codes can be used to simultaneously correct errors and erasures when the network performs random linear network coding and the edges are noisy channels. This is done by combining the subspace code with a classical…

In this survey paper it is illustrated how spectral clustering methods for unweighted graphs are adapted to the dense and sparse regimes. Whereas Laplacian and modularity based spectral clustering is apt to dense graphs, recent results show…

A new coding scheme for image transmission over noisy channel is proposed. Similar to standard image compression, the scheme includes a linear transform followed by successive refinement scalar quantization. Unlike conventional schemes, in…