In a sequence of generalized Fibonacci trees, the kth tree has the (k c(i))th tree as its ith subtree for a nondecreasing sequence of positive integers c(i), i = 1; :::; r. For particular initializations, each tree in the generalized Fibonacci sequence solves a minimax coding problem related to Varn coding. Speci cally, each symbol from a uniformly distributed source is to be encoded by a strin...

Code generation is regarded as an essential part of model-driven development (MDD) to systematically transform the abstract models to concrete code. One current challenges of templatebased code generation is that output-specific information, i.e., information about the generated source code, is not explicitly modeled and, thus, not accessible during code generation. Existing approaches try to e...

An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.

An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.

The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many MDS codes for b-symbol read channels have been constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11] for b > 2). In this paper we s...

In this paper, an OFDM-CDM (orthogonal frequency division multiplexing code division multiplexing) system with adaptive symbol mapping is presented. This combination enables a robust transmission with flexible error protection and data rate adaptation for parallel data streams by exploiting additional diversity due to CDM. Performance results are presented for fading channels where OFDMCDM with...

In this paper, the performance of composite microscopic and macroscopic diversity combining over concatenated double error correcting BCH inner codes and majority-logic-like vector symbol (MLLVS) codes within lognormally shadowed Rayleigh fading channels are analyzed. In the communication model, CPM is used with microscopic combining at the receiving stations before outer code decoding and macr...

6&. NAME OF PERFORMING ORGANIZATION 6b. OFFICE SYMBOL 7a. NAME OF MONITORING ORGANIZATION University of California (If applicable) U.S. Army Research Institute for at Irvine the Behavioral and Social Sciences 6c. ADDRESS (City, State, and ZIP Code) 7b. ADDRESS (City, State, and ZIP Code) Department of Information and Computer 5001 Eisenhower Avenue Science, University of California Alexandria, ...

Brain-Computer Interfaces (BCI ’s) enable us to infer intentional control signals from brain activity. The Visual Speller is a BCI based on event related potentials (ERP ’s) in the electroencephalogram, such as the P300 (a positive deflection in the EEG about 300 ms after a rarely occuring stimulus). In the classical paradigm one trial (i.e. prediction of one symbol) consists of successive high...

We show that the binary Golay code is slightly more power efficient than the extended binary Golay code under maximum-likelihood (ML), hard-decision decoding. In fact, if a codeword from the extended code is transmitted, one cannot achieve a higher probability of correct decoding than by simply ignoring the 24th symbol and using an ML decoder for the non-extended code on the first 23 symbols. T...