Filters








7,555 Hits in 4.7 sec

Decision Procedure for the Existence of Two-Channel Prefix-Free Codes [article]

Hoover H. F. Yin, Ka Hei Ng, Yu Ting Shing, Russell W. F. Lai, Xishi Wang
2019 arXiv   pre-print
It is natural to ask whatever there exists an efficient decision procedure for the existence of multichannel prefix-free codes.  ...  The Kraft inequality gives a necessary and sufficient condition for the existence of a single channel prefix-free code.  ...  EFFICIENT DECISION PROCEDURE FOR TWO-CHANNEL PREFIX-FREE CODES In this section, we present an efficient decision procedure for the existence of two-channel prefix codes via a constrained two-dimensional  ... 
arXiv:1904.12112v1 fatcat:3efr5suxkrdlrnewsh5xnicmlu

Soft-Decision Decoding of Fixed-Rate Entropy-Coded Trellis-Coded Quantizer Over a Noisy Channel

S. Nikneshan, A.K. Khandani, P. Kabal
2004 IEEE Transactions on Vehicular Technology  
This paper presents new techniques to improve the performance of a fixed-rate entropy-coded trellis-coded quantizer (FE-TCQ) in transmission over a noisy channel.  ...  We show that the optimal decoder for the FEVQ can be a maximum likelihood decoder where a trellis structure is used to model the set of possible code words and the Viterbi algorithm is subsequently applied  ...  Prefix Code(II,c) has the best performance in an error-free channel, whereas prefix Code(II,b) shows the most robust performance in a noisy channel.  ... 
doi:10.1109/tvt.2004.823482 fatcat:r6ogizesrnddlinnu3h7c7quzu

Cumulative subject index

1978 Information and Control  
que- ries, 36, 119 Combinatorial optimization problems, branch-and-bound procedure and state-space representation, 36, 1 Combinatorial property of finite prefix codes, 37, 267 Combinatorial systems  ...  stable string languages of, 37, 134 Linear block codes optimal encodings for unequal error protection, 37, 150 Linear languages I-locally, 37, 1 Linear-quadratic-Gaussian decision prob- lems two-criteria  ... 
doi:10.1016/s0019-9958(78)90707-6 fatcat:3g6qa5hi2zc2lgyyvndbar65di

Page 621 of Mathematical Reviews Vol. 48, Issue 2 [page]

1974 Mathematical Reviews  
Author’s summary: “Systematic prefix codes play an important role in coding theory; we relate them with the problem of the partition of a free (sub-) monoid into two free sub-monoids.  ...  We show also that among the dual codes of a systematic prefix code A there exists one and only one which appears in the automaton recognizing A*.  ... 

List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity

Ilya Dumer, Grigory Kabatiansky, CÉdric Tavernier
2008 IEEE Transactions on Information Theory  
Let a biorthogonal Reed-Muller code RM (1; m) of length n = 2 m be used on a memoryless channel with an input alphabet 61 and a real-valued output .  ...  For an arbitrarily small , we design an algorithm that outputs this list of codewords with the linear complexity order of n ln 2 bit operations.  ...  This paper advances the results of [4] in two different directions. First, we extend list decoding of codes to an arbitrary memoryless semi-continuous channel.  ... 
doi:10.1109/tit.2008.929014 fatcat:7xbgnkivyjhh3o6mhi627xngem

Page 897 of Mathematical Reviews Vol. 50, Issue 3 [page]

1975 Mathematical Reviews  
The average code length Is defined by L=>,"p,/, and the Huffman coding procedure constructs a prefix code with minimum average length.  ...  In this paper, a new class of codes called augmented parity check codes (APC codes) is introduced and proposed for race- free encoding.  ... 

On the Design of Variable-Length Error-Correcting Codes

Ting-Yi Wu, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han
2013 IEEE Transactions on Communications  
A joint source-channel coding problem that combines the efficient compression of discrete memoryless sources with their reliable communication over memoryless channels via binary prefix-free variable-length  ...  Two variations of the priority-first-search-based code construction algorithm are also provided.  ...  CONCLUSION In this work, a novel search algorithm is proposed for constructing optimal prefix-free VLECs for the effective joint source-channel coding of memoryless sources over memoryless channels.  ... 
doi:10.1109/tcomm.2013.072913.120564 fatcat:xtivtp6n3fbrlanhwolueerbei

Multicarrier Spread Spectrum Communication Scheme for Cruising Sensor Network in Confined Underwater Space

Yuan Wang, Zhoumo Zeng, Yibo Li, Jinsheng Zhang, Shijiu Jin
2014 International Journal of Distributed Sensor Networks  
This scheme can be robust in confined underwater channels when coupled with turbo code. The simulation and experimental results prove the feasibility and reliability of this scheme.  ...  The main distinction in confined underwater spaces is the existence of strong multipath arrivals reflected by the boundaries, which can cause more severe intersymbol interference (ISI).  ...  The basic principle and procedure of SS-COFDM (coded OFDM) are given in Figure 2 .  ... 
doi:10.1155/2014/165749 fatcat:tqfuj5bporbmvdgn7eghrlegtu

Audio Watermarking for Automatic Identification of Radiotelephone Transmissions in VHF Maritime Communication [chapter]

Oleksandr V., Vitaliy M.
2012 Watermarking - Volume 2  
Prefix results in the host signal distortions and serves as a penalty for ISI decreasing. The length of prefix comes from the channel impulse response.  ...  It is essential that AW doesn't require altering an existing radio installation and operational procedures. AW identification keeps standard equipment and procedures.  ...  The work also presents a wide array of algorithms ranging from intelligent bit replacement to more traditional methods like ICA. The current work is split into two books.  ... 
doi:10.5772/36851 fatcat:qaxancbhlvfs5ohdur733l3ms4

Analysis of Hard Decision and Soft Decision decoding mechanism using Viterbi Decoder in Presence of Different Adaptive Modulations

Shovon Nandi, Narendra Nath Pathak, Arnab Nandi
2020 Zenodo  
This paper exhibits the performance of both the hard and soft decision method of decoding for analysis of different existing adaptive modulation techniques by using Viterbi decoder.  ...  While in soft decision decoding all the possible code words with the minimum Euclidean distance is selected in presence of Additive White Gaussian Noise (AWGN) channel.  ...  ACKNOWLEDGEMENT The authors deeply acknowledge the support from laboratory of Department of ECE, Bengal Institute of Technology (Techno India Group), Dr. B. C.  ... 
doi:10.5281/zenodo.5274016 fatcat:anpma4bqbrbzll42agf2r5j2qu

Light-Weight Addressing and Routing Schemes for Resource-Constrained WPAN Devices

Uttam Kumar Roy
2020 International Journal on Smart Sensing and Intelligent Systems  
The addressing scheme leverages the properties of prefix code and allows devices to have arbitrary number of children and does not also limit network depth.  ...  The routing algorithm uses simple mathematical and/or logical calculations to take routing decisions.  ...  The proposed scheme eliminates some of the existing problems of ZigBee Tree routing. The routing algorithm leverages properties of prefix code and does not use any routing table.  ... 
doi:10.21307/ijssis-2019-017 fatcat:jhrt6menljddlfcrcy5a6eiv4y

Codes and local constraints

Antonio Restivo
1990 Theoretical Computer Science  
We prove that, if there exists a finite T-complete set, then there exists also a finite T-indecomposable set. The decision procedure can then be obtained by the constructions of the previous theorem.  ...  A set of words * is complete if F(X*) = X is complete if any word of /I* is factor of some wo e whole capacity of t e channel. The fo erger states the equi lence, in pa.rticul of these two notions.  ... 
doi:10.1016/0304-3975(90)90046-k fatcat:z3egwna2kjehjat7qbrqetocdq

FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION

KRYSTIAN DUDZINSKI, STAVROS KONSTANTINIDIS
2012 International Journal of Foundations of Computer Science  
The method provides simple and uniform decision procedures for the basic questions of property satisfaction and maximality for regular languages.  ...  Our work includes statements about the hardness of deciding some of the problems involved. It turns out that maximality can be hard to decide even for "classical" code properties of finite languages.  ...  For example, the prefix relation ρ p , with (u, v) ∈ ρ p iff u is a prefix of v, defines the property of prefix codes.  ... 
doi:10.1142/s0129054112400059 fatcat:vwzicazndzcdxfyauewxxeynvu

Preamble Design and Iterative Channel Estimation for OFDM/Offset QAM System

Su Hu, Gang Wu, Shaoqian Li
2009 Journal of Networks  
method B is of higher efficiency and preferred for the Channel coding Convolutional code, K=7, [133,171] practical  ...  Normally, there are two different ways for symbol detector (hard decisions and soft decisions), therefore  ... 
doi:10.4304/jnw.4.10.1050-1057 fatcat:3nhnbicqb5dz3me2dvyyanfv2u

CPRecycle

Saravana Rathinakumar, Bozidar Radunovic, Mahesh K. Marina
2016 Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies - CoNEXT '16  
However, most of the existing systems over-provision the size of the cycle prefix considering the worst case scenarios which rarely occur.  ...  We further develop an algorithm that is able to find the optimal starting position of the FFT window for each subcarrier using a Gaussian kernel density function and a fixed sphere maximum likelihood detector  ...  Most of the OFDM standards use at most two preambles for channel estimation and in each preamble the maximum number of samples for each subcarrier is the number of samples in the cyclic prefix.  ... 
doi:10.1145/2999572.2999577 dblp:conf/conext/RathinakumarRM16 fatcat:2pjfthumdbb2xc6mmqoc2ujqwy
« Previous Showing results 1 — 15 out of 7,555 results