Cecilio Pimentel

Orcid: 0000-0003-2632-919X

According to our database1, Cecilio Pimentel authored at least 60 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Symbolic Dynamical Filtering via Variable Length Markov Model and Machine Learning.
IEEE Access, 2024

2023
q-Analogs Over Finite Fields: Definition, Algebraic Properties, and Application in Pseudo-Random Number Generators.
IEEE Trans. Circuits Syst. II Express Briefs, August, 2023

A Fragile Image Watermarking Scheme in DWT Domain Using Chaotic Sequences and Error-Correcting Codes.
Entropy, March, 2023

Tag Generation Using Chaotic Sequences for Physical-Layer Authentication.
IEEE Access, 2023

2022
Pseudo-Chaotic Sequences Generated by the Discrete Arnold's Map Over Z<sub>2<sup>m</sup></sub>: Period Analysis and FPGA Implementation.
IEEE Trans. Instrum. Meas., 2022

Robust image watermarking algorithm using chaotic sequences.
J. Inf. Secur. Appl., 2022

Successive Interference Cancellation Decoding With Adaptable Decision Regions for NOMA Schemes.
IEEE Access, 2022

2021
Chaos-Based Space-Time Trellis Codes With Deep Learning Decoding.
IEEE Trans. Circuits Syst. II Express Briefs, 2021

One-Dimensional Pseudo-Chaotic Sequences Based on the Discrete Arnold's Cat Map Over ℤ₃ᵐ.
IEEE Trans. Circuits Syst. II Express Briefs, 2021

2020
A Symbolic Dynamics Approach to Trellis-Coded Chaotic Modulation.
IEEE Trans. Circuits Syst. II Express Briefs, 2020

Markov modeling of dynamical systems via clustering and graph minimization.
Digit. Signal Process., 2020

2019
Image encryption using block cipher and chaotic sequences.
Signal Process. Image Commun., 2019

Markov modeling of discrete fading channels using birth-death channels.
Int. J. Commun. Syst., 2019

Digital Communication Systems Based on Three-Dimensional Chaotic Attractors.
IEEE Access, 2019

2017
Modeling Fading Channels With Binary Erasure Finite-State Markov Channels.
IEEE Trans. Veh. Technol., 2017

Markov modeling of OFDM transmission over frequency selective channels.
Proceedings of the 40th International Conference on Telecommunications and Signal Processing, 2017

2016
LDPC Decoding Over Nonbinary Queue-Based Burst Noise Channels.
IEEE Trans. Veh. Technol., 2016

On the Weight Enumerator of Periodically Time-Varying Convolutional Codes.
IEEE Commun. Lett., 2016

A smooth chaotic map with parameterized shape and symmetry.
EURASIP J. Adv. Signal Process., 2016

Optimal power distribution in non-binary LDPC code-based cooperative wireless networks.
Comput. Networks, 2016

BETA random waypoint mobility model for wireless network simulation.
Ad Hoc Networks, 2016

2015
Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis.
Telecommun. Syst., 2015

2014
A new computational decoding complexity measure of convolutional codes.
EURASIP J. Adv. Signal Process., 2014

On the follower set graph of shifts of finite type.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Turbo Decoding Using the Sectionalized Minimal Trellis of the Constituent Code: Performance-Complexity Trade-Off.
IEEE Trans. Commun., 2013

On the complexity-performance trade-off in soft-decision decoding for unequal error protection block codes.
EURASIP J. Adv. Signal Process., 2013

A computational complexity measure for trellis modules of convolutional codes.
Proceedings of the 36th International Conference on Telecommunications and Signal Processing, 2013

2012
A Discrete Queue-Based Model for Capturing Memory and Soft-Decision Information in Correlated Fading Channels.
IEEE Trans. Commun., 2012

High-rate systematic recursive convolutional encoders: minimal trellis and code search.
EURASIP J. Adv. Signal Process., 2012

Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis.
Ann. des Télécommunications, 2012

Sectionalization of the minimal trellis module for convolutional codes.
Proceedings of the 35th International Conference on Telecommunications and Signal Processing, 2012

2011
A Discrete Queue-Based Model for Soft-Decision Demodulated Correlated Fading Channels.
Proceedings of the 73rd IEEE Vehicular Technology Conference, 2011

Minimal trellis for systematic recursive convolutional encoders.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
On Symbol Versus Bit Interleaving for Block-Coded Binary Markov Channels.
IEEE Trans. Veh. Technol., 2010

Deriving the Probabilistic Capacity of General Run-Length Sets Using Generating Functions
CoRR, 2010

2009
Packet-Based Modeling of Reed-Solomon Block-Coded Correlated Fading Channels Via a Markov Finite Queue Model.
IEEE Trans. Veh. Technol., 2009

Distance Spectrum and Expurgated Union Bound of Space-Time Trellis Codes in Quasi-Static Rician Fading Channels.
IEEE Trans. Veh. Technol., 2009

Convolutional codes under a minimal trellis complexity measure.
IEEE Trans. Commun., 2009

On the Capacity of Constrained Systems
CoRR, 2009

A Discrete Channel Model for Capturing Memory and Soft-Decision Information: A Capacity Study.
Proceedings of IEEE International Conference on Communications, 2009

2008
Analysis of the Go-Back- Protocol on Finite-State Markov Rician Fading Channels.
IEEE Trans. Veh. Technol., 2008

Generalized Punctured Convolutional Codes with Unequal Error Protection.
EURASIP J. Adv. Signal Process., 2008

Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
CoRR, 2008

Capacity of General Discrete Noiseless Channels
CoRR, 2008

2007
On the Power Spectral Density of Constrained Sequences.
IEEE Trans. Commun., 2007

2006
Analysis of the Go-Back-N Protocol on Finite State Markov Fading Channels.
Proceedings of the 63rd IEEE Vehicular Technology Conference, 2006

On the Behavior of the Distance Spectrum of Convolutional Codes under a Minimal Trellis Complexity Measure.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Redundancy in homophonic coding and a new homophonic coding technique.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Generalized punctured convolutional codes.
IEEE Commun. Lett., 2005

2004
Finite-state Markov modeling of correlated Rician-fading channels.
IEEE Trans. Veh. Technol., 2004

An Iterative Matrix-Based Procedure for Finding the Shannon Cover for Constrained Sequences.
Proceedings of the Telecommunications and Networking, 2004

2003
A combinatorial approach to finding the capacity of the discrete noiseless channel.
IEEE Trans. Inf. Theory, 2003

On the computation of weight enumerators for convolutional codes.
IEEE Trans. Commun., 2003

2002
Generating series and performance bounds for convolutional codes over burst-error channels.
IEEE Trans. Veh. Technol., 2002

Shannon capacity and codes for communicating with a chaotic laser.
IEEE Trans. Commun., 2002

2001
Enumerative Combinatorics and Shannon's Theory of Discrete Noiseless Channels.
Electron. Notes Discret. Math., 2001

1999
Analysis of soft decision decoding of interleaved convolutional codes over burst channels.
Proceedings of the 1999 IEEE Wireless Communications and Networking Conference, 1999

1998
Concatenated coding performance for FSK modulation on time-correlated Rician fading channels.
IEEE Trans. Commun., 1998

1997
Non-Interleaved Reed-Solomon Coding Performance on Finite State Channels.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1993
Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm.
IEEE Trans. Inf. Theory, 1993


  Loading...