Sharif Digital Repository

One of the categories of decoding techniques for DFT codes in erasure channels is the class of iterative algorithms. Iterative algorithms can be considered as kind of alternating mapping methods using the given information in a repetitive way. In this paper, we propose a new iterative method for decoding DFT codes. It will be shown that the proposed method outperforms the well-known methods such as Wiley/Marvasti, and ADPW methods in the decoding of DFT codes in erasure channels. © Springer-Verlag 2004  

In this paper it is shown that every m × n array in which each symbol appears at most (mn - 1) / (m - 1) times has a transversal, when n ≥ 2 m3. © 2006 Elsevier B.V. All rights reserved  

We describe several return code schemes for secure vote submission in electronic voting systems. We consider a unified treatment where a return code is generated as a multiparty computation of a secure MAC tag applied on an encrypted message submitted by a voter. Our proposals enjoy a great level of flexibility with respect to various usability, security, and performance tradeoffs. © 2017, Springer International Publishing AG  

This paper presents a high level method called Matrix code to protect SRAM-based memories against multiple bit upsets. The proposed method combines hamming code and parity code to assure the reliability of memory in presence of multiple bit-upsets with low area and performance overhead. The method is evaluated using one million multiple-fault injection experiments; next reliability and MTTF of the protected memories are estimated based on fault injection experiments and several equations. The fault detection/correction coverage are also calculated and compared with previous methods i.e., Reed-Muller and hamming code. The results reveal that the proposed method behaves better than these... 

In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph with minimum number of edges for both one-shot and asymptotic cases. For the general case of possibly distinct rates, we show that for one-shot and asymptotic linear index coding, as well as asymptotic non-linear index coding, each critical graph is a union of disjoint strongly connected subgraphs (USCS). On the other hand, we identify a non-USCS critical graph for a one-shot non-linear index coding problem. In addition, we show that the capacity region of... 

A general construction for deletion/insertion correcting codes is proposed by concatenating codes derived from a heuristic maximal independent set algorithm on an appropriately defined graph. Our heuristic algorithm is polynomial with respect to the number of nodes in the graph. This methodology may be used for construction of any length n, s-deletion code. Our experimental results show that cardinalities of our codebooks exceed sizes of all previously known constructions. In fact, they are comparable to Levenshteins lower bound  

We propose a new coded cooperation scheme for wireless communications to obtain transmit diversity in the scenarios that agents such as mobile handsets, sensor network nodes and etc., due to size, power or other constraints, cannot utilize multiple antennas. New scheme supports more than two cooperative users with a relatively low cooperation level. We evaluate the performance of the proposed scheme in a frequency nonselective slow fading channel. For two cooperative users, we provide the exact analytical analysis. However, for more than two users, as the analytical analysis is very complicated, our performance evaluation is based on computer simulations. Our numerical results show that each... 

FPGAs are an appealing solution for the space-based remote sensing applications. However, in a low-earth orbit, configuration bits of SRAM-based FPGAs are susceptible to single-event upsets (SEUs). In this paper, a new protected CLB and FPGA architecture are proposed which utilize error detection and correction codes to correct SEUs occurred in LUTs of the FPGA. The fault detection and correction is achieved using online or offline fast detection and correction cycles. In the latter, detection and correction is performed in predefined error-correction intervals. In both of them error detections and corrections of k-input LUTs are performed with a latency of 2k clock cycle without any... 

In this letter, we introduce a whole new approach in defining and representing optical orthogonal codes (OOCs), namely, outer-product matrix representation. Instead of applying commonly used approaches based on inner product to construct OOC codes, we use the newly defined approach to obtain a more efficient algorithm in constructing and generating OOC codes. The outer-product matrix approach can obtain a family of OOC codes with a cardinality closer to the Johnson upper bound, when compared with the previously defined accelerated greedy algorithm using the inner-product approach. We believe the new look introduced in this letter on OOCs could help to devise new approaches in designing and... 

We prove that the inner products of spherical s-distance t-designs with t≥2s−2 (Delsarte codes) and s≥3 are rational with the only exception being the icosahedron. In other formulations, we prove that all sharp configurations have rational inner products and all spherical codes which attain the Levenshtein bound, have rational inner products, except for the icosahedron. © 2022 Elsevier Inc  

We establish several new results on Marton's inner bound on the capacity region of the general broadcast channel. Inspired by the fact that Marton's coding scheme without superposition coding is optimal in the Gaussian case, we consider the class of binary input degraded broadcast channels with no common message that have the same property. We characterize this class. We also establish new properties of Marton's inner bound that help restrict the search space for computing the Marton sum rate. In particular, we establish an extension of the XOR case of the binary inequality of Nair, Wang, and Geng  

Multi-layer schemes have been proposed for steganography. Also some authors have combined these methods with the idea of wet paper codes and gained higher embedding efficiency. This paper proposes a generalized multi-layer method for wet paper embedding. First, the cover bits are divided into blocks and, by combining these bits in groups of 3, a pyramid is formed. Next, the secret message is embedded through a layer-by-layer procedure. The proposed method has higher embedding efficiency in some cases and provides more flexibility for choosing the embedding payload, especially in lower payload conditions  

In this work, we study the performance of polar codes for lossy compression of a Gaussian source with a side information at decoder; known as the quadratic-Gaussian Wyner-Ziv problem. First we extend the binary polar codes to q-ary for the Wyner-Ziv problem. We show that the nested q- Ary polar codes are optimal for this case. Then we present two polar coding schemes for the Gaussian Wyner-Ziv problem. In the first scheme, we achieve a rate above the Wyner-Ziv rate-distortion function with a gap of 0.5 bits compared with the optimal rate. This scheme utilizes a successive cancellation decoder and is optimal in weak side-information cases when the decoder side-information noise variance is... 

We consider a content delivery network where multiple servers are connected to multiple cache-enabled clients. Clients request their corresponding contents from the servers and servers collaboratively transmit packets to fulfill all the requests. It is assumed that some contents are stored in the caches in off-peak time of the network without knowing the actual requests, the so called cache content placement phase. The goal is to minimize the worst case delay in the content delivery phase. Considering a random linear network, we propose a coding strategy which exploits servers' multiplexing gains as well as caches' global and local coding gains. The main idea in our coding scheme is to... 

In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of secret keys with the transmitter. We assume perfect secrecy, meaning that the eavesdropper should not be able to retrieve any information about the message set. This problem is a generalization of the Shannon's cipher system. We study the minimum key lengths for zero-error and perfectly secure index coding problems  

A function is said to be additive if, similar to mutual information, expands by a factor of n, when evaluated on n i.i.d. repetitions of a source or channel. On the other hand, a function is said to satisfy the tensorization property if it remains unchanged when evaluated on i.i.d. repetitions. Additive rate regions are of fundamental importance in network information theory, serving as capacity regions or upper bounds thereof. Tensorizing measures of correlation have also found applications in distributed source and channel coding problems as well as the distribution simulation problem. Prior to our work only two measures of correlation, namely the hypercontractivity ribbon and maximal... 

A new air shower experiment of the Alborz Observatory, Alborz-I, located at the Sharif University of Technology, Iran, will be constructed in near future. An area of about 30×40 m2 will be covered by 20 plastic scintillation detectors (each with an area of 50×50 cm2). A series of experiments have been performed to optimize the height of light enclosures of the detectors for this array and the results have been compared to an extended code simulation of these detectors. Operational parameters of the detector obtained by this code are cross checked by the Geant4 simulation. There is a good agreement between the extended-code and Geant4 simulations. We also present further discussions on the... 

In this study, by exploiting the properties of finite-length polar codes, the authors introduce a physical layer encryption scheme to make secure (from a computational security perspective) and efficient communication between a sender (Alice) and a legitimate receiver (Bob) against both active and passive attacks, simultaneously. To prevent active attacks, two techniques are considered: (i) a novel method is introduced to keep the generator matrix of polar code secret from an active attacker (Oscar); (ii) a proper joint polar encoding/encryption algorithm based on the hidden generator matrix is introduced. Two additional strategies are considered against passive attacks: (i) a new method is... 

The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter–receiver pairs, in which the cognitive transmitter has the message of the primary one as side information. In addition, the channel is affected by two channel state sequences, which are known at the cognitive transmitter and the corresponding receiver, separately. The cognitive transmitter should cooperate with the primary one, and it wishes to keep its message secure at the primary receiver. The achievable equivocation-rate regions for this channel are derived using two approaches: the binning scheme coding and... 

Question and answer (Q&A) websites like Stack Overflow are one of the important sources of code examples in which developers can ask their questions and leave their answers about programming issues. Since the number of programmers who use these websites are increasing and a large number of questions and answers are being posted there by them, verifying the quality of all the answers and particularly the code snippets in them is impossible. Consequently, some code snippets might be of low quality and/or with faults. To mitigate this issue, we introduce ExRec (Example Recommender), an Eclipse plugin with which programmers can contribute in improving the quality of code snippets in the answers...