The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider different variants of the modified GPT cryptosystem. The main approach for increasing the security of GPT is randomizing the public key. Randomization is done through addition or concatenation of a distortion matrix to the generator matrix of the rank code or to the column scrambler.We show that all techniques are somewhat equivalent. In particular, public keys of different variants can...
The task of detecting and mitigating Cognitive Radios (CRs) operating as constant jammers in a Cognitive Radio network (CRN) can be very daunting. The CR constant jammers prey on the adaptable functionalities of CRN so as to cause serious denial of service to the users of the network. In addition, these jammers are capable of introducing value faults in pathological cases as a result of being able...
Security oriented codes are considered as one of the most efficient countermeasures against fault injection attacks. Their efficiency is usually measured in terms of their error masking probability. This criterion is applicable in cases where it is possible to distinguish between random errors and malicious attacks. In practice, if the induced errors are not fixed for several clock cycles, it is difficult...
An efficient component-interleaved nonbinary Low Density Parity Check Code (LDPC) scheme is proposed, which can significantly outperform the binary LDPC codes scheme without a component interleaver on fading channels. In this paper, the bit-error-rate (BER) performances of nonbinary LDPC codes are compared with the binary LDPC codes on the independent Rayleigh fading channel. And then we use a fast...
We study a relay channel with confidential messages (RCC), which involves a sender, a receiver and a relay. In the RCC, a common information must be transmitted to both a receiver and a relay and also a private information to the intended receiver, while keeping the relay as ignorant of it as possible. The level of ignorance of the relay rather than the private message is measured by the equivocation...
Imai-Kamiyanagi codes are a class of linear double error correcting (DEC) codes suitable for fast parallel error correction. The parity-check matrix H' of these codes is composed of submatrices based on BCH codes of small codeword length. To reduce the complexity of the decoder, the embedded BCH codes are used for error correction. To improve the applicability of Imai-Kamiyanagi codes, in this paper...
Due to their ability to provide high data rates, multiple-input multiple-output (MIMO) systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In this paper, we employ the Sequential Decoder using the Fano Algorithm for large MIMO systems. A parameter called the bias is varied to attain different performance-complexity...
In this paper we will analyze the influence of using Low Density Parity Check LDPC codes in different channels environment. The performances of LDPC codes are estimated in several scenarios. The simulation software gives us the possibilities to choose between different communications channels according to the encoding matrix used. Also we can adjust a number of parameters, thing that help to find...
In this paper, a new fast convergence hybrid decoding algorithm based on multi-dimensional searhing is proposed for decoding LDPC codes. The main idea of this algorithm is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To this end, the algorithm does multidimensional searching between all possible bit positions that could flip...
The performance of Polar codes has been proved to achieve the Shannon capacity when N, the block length, tends to infinity. However, finite block length performance of Polar codes is rather poor compared to other capacity approaching codes such as LDPC (Low-Density Parity-Check) codes. In this paper, we propose a concatenated scheme with a polar code as an inner code and a Reed-Solomon code as an...
Sparse matrix-vector multiplication (SMVM) is a crucial primitive used in a variety of scientific and commercial applications. Despite having significant parallelism, SMVM is a challenging kernel to optimize due to its irregular memory access characteristics. Numerous studies have proposed the use of FPGAs to accelerate SMVM implementations. However, most prior approaches focus on parallelizing multiply-accumulate...
We analyze the error performance of coding scheme that is found in the protocol for secret key agreement based on the Gaussian channel. The approach is regarded as the Slepian-Wolf coding or the source coding with side information at the decoder. One remarkable feature of the coding in the key agreement is that two parties may extract the set of reliable signals before Slepian-Wolf coding is performed...
In this paper, we propose a non-binary belief propagation approach (NB-BP) for detection of $M$-ary modulation symbols and decoding of $q$-ary LDPC codes in large-scale multiuser MIMO systems. We first propose a message passing based symbol detection algorithm which computes vector messages using a scalar Gaussian approximation of interference, which results in a total complexity of just $O(KN\sqrt{M})$,...
Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the coding vector. This adds to the overall energy consumption and is problematic for computational limited and battery driven platforms. In this work we present an approach to RLNC where the code is sparse and...
In this paper, we propose a chain based syndrome coding scheme for secure communication in a wiretap channel, where the main channel is noiseless and the eavesdropper channel is binary symmetric. The most relevant aspect of the scheme, which represents a generalization of Wyner's conventional syndrome coding scheme, relates to the use of a chain of syndromes to encode the message. By using the eavesdropper...
In this paper, a novel remapping design for multiway relay system with multi-user (MU) is presented. Every user exchanges information with its partners via the relay. The two communication terminals have different modulation schemes according to their individual channel quality.We term this system an adaptive modulation asymmetric multi-way relaying networks, in which signal space alignment for network...
We propose a low complexity graph-based linear minimum mean square error (LMMSE) equalizer which considers both the intersymbol interference (ISI) and the effect of non-white noise inherent in Faster-than-Nyquist (FTN) signaling. In order to incorporate the statistics of noise signal into the factor graph over which the LMMSE algorithm is implemented, we suggest a method that models it as an autoregressive...
Wireless broadcast has been widely utilized to deliver information of common interest to a large number of users. A major challenge for wireless broadcast is that wireless links are often unreliable. Further, it is not feasible for every receiver to acknowledge the correct reception of broadcasted packets. In this paper we investigate the use of wireless broadcast to deliver a given number of packets...
In this paper, we present a practical Dirty Paper Coding (DPC) scheme using sum codes based on LDPC codes. While a typical sum-code-based DPC scheme uses a constrained decoder as part of the encoding operation, such an approach fails in the case of LDPC codes since the constrained decoder based on a standard LDPC decoder tends to get stuck at highly suboptimal points in typical scenarios. We get around...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.