We identify the Baker-Campbell-Hausdorff recursion driven by a weight λ=1 Rota-Baxter operator with Magnus expansion relative to post-Lie structure naturally associated corresponding algebra. Post-Lie and BCH-recursion are reviewed before proof of main result.

In this work we investigate the weight structure of cyclic codes of composite length n = n l n 2 , where n1 and n2 are relatively prime. The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cy...

Data <span>transmission in orthogonal frequency division multiplexing (OFDM) system needs source and channel coding, the transmitted data suffers from bad effect of large peak to average power ratio (PAPR). Source code codes can be joined using different codes. Variable length error correcting (VLEC) is one these VLEC used mat lab simulation for image transmission OFDM system, compared fi...

We introduce the notion of fuzzy dot subalgebras in BCH-algebras, and study its various properties. 2000 Mathematics Subject Classification. 06F35, 03G25, 03E72.

We derive a new estimate for the error term in the binomial approximation to the distance distribution of BCH codes. This is an improvement on the earlier bounds

We give bounds for the minimal distance of duals of binary BCH codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the si...