Oscar Y. Takeshita

33 papers B 5C 1Journal 22Unranked 4

Year	Rank	Type	Title / Venue / Authors
2014	—	`conf`	Joint Analog and Digital Interference Cancellation. DySPAN Scott Enserink, Michael P. Fitz, Changyi Gu, Thomas R. Halford, Iftekhar Hossain, Sungill Kim, Oscar Y. Takeshita
2013	—	`ch.`	Turbo codes over finite fields. Handbook of Finite Fields Oscar Y. Takeshita
2011	J	`jnl`	On Inverses for Quadratic Permutation Polynomials over Integer Rings CoRR Jonghoon Ryu, Oscar Y. Takeshita
2011	J	`jnl`	Performance of a Concurrent Link SDMA MAC Under Practical PHY Operating Conditions. IEEE Trans. Veh. Technol. Pengkai Zhao, Babak Daneshrad, Ajit Warrier, Weijun Zhu, Oscar Y. Takeshita
2010	—	`conf`	Field Trial Results of a 4X4 MIMO-OFDM Real Time Testbed. ICC Omar A. Nasr, Oscar Y. Takeshita, Weijun Zhu, Babak Daneshrad
2007	J	`jnl`	Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective. IEEE Trans. Inf. Theory Oscar Y. Takeshita
2006	B	`conf`	A Compact Construction for LDPC Codes using Permutation Polynomials. ISIT Oscar Y. Takeshita
2006	B	`conf`	A New Metric for Permutation Polynomial Interleavers. ISIT Oscar Y. Takeshita
2006	J	`jnl`	A simple coefficient test for cubic permutation polynomials over integer rings. IEEE Commun. Lett. Yen-Lun Chen, Jonghoon Ryu, Oscar Y. Takeshita
2006	J	`jnl`	On maximum contention-free interleavers and permutation polynomials over integer rings. IEEE Trans. Inf. Theory Oscar Y. Takeshita
2006	J	`jnl`	On quadratic inverses for quadratic permutation polynomials over integer rings. IEEE Trans. Inf. Theory Jonghoon Ryu, Oscar Y. Takeshita
2006	B	`conf`	Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes. ISIT Eirik Rosnes, Oscar Y. Takeshita
2006	J	`jnl`	Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective CoRR Oscar Y. Takeshita
2006	C	`conf`	Rapid Dual Channel Frequency and Frame Synchronizer for OFDM Packet Transmission. MobiQuitous Hyun Seo Oh, Jonghoon Ryu, Oscar Y. Takeshita
2005	J	`jnl`	A New Construction for LDPC Codes using Permutation Polynomials over Integer Rings CoRR Oscar Y. Takeshita
2005	B	`conf`	A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes. ISIT Aditi Kothiyal, Oscar Y. Takeshita
2005	J	`jnl`	Extended tail-biting schemes for turbo codes. IEEE Commun. Lett. Jing Sun, Oscar Y. Takeshita
2005	J	`jnl`	Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Trans. Inf. Theory Jing Sun, Oscar Y. Takeshita
2005	J	`jnl`	Iterative reliability-based decoding of linear block codes with adaptive belief propagation. IEEE Commun. Lett. Aditi Kothiyal, Oscar Y. Takeshita, Wenyi Jin, Marc P. C. Fossorier
2005	J	`jnl`	On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings CoRR Oscar Y. Takeshita
2005	J	`jnl`	On Quadratic Inverses for Quadratic Permutation Polynomials over Integer Rings CoRR Jonghoon Ryu, Oscar Y. Takeshita
2005	J	`jnl`	On maximum-length linear congruential-sequences-based low-density parity-check codes. IEEE Trans. Commun. Jing Sun, Oscar Y. Takeshita
2004	J	`jnl`	Multi-antenna testbeds for research and education in wireless communications. IEEE Commun. Mag. Raghu Mysore Rao, Weijun Zhu, Stephan Lang, Christian Oberli, David W. Browne, Jatin Bhatia, Jean-François Frigon, Jingming Wang, Parul Gupta, Heechoon Lee, Daniel N. Liu, ShingWa G. Wong, Mike Fitz, Babak Daneshrad, Oscar Y. Takeshita
2003	J	`jnl`	On the design of space-time and space-frequency codes for MIMO frequency-selective fading channels. IEEE Trans. Inf. Theory Hesham El Gamal, A. Roger Hammons Jr., Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita
2002	J	`jnl`	A rank criterion for QAM space-time codes. IEEE Trans. Inf. Theory Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita
2001	J	`jnl`	Full rate space-time turbo codes. IEEE J. Sel. Areas Commun. Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita
2001	J	`jnl`	On the frame-error rate of concatenated turbo codes. IEEE Trans. Commun. Oscar Y. Takeshita, Oliver M. Collins, Peter C. Massey, Daniel J. Costello Jr.
2001	—	`conf`	Space-time codes performance criteria and design for frequency selective fading channels. ICC Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita
2000	J	`jnl`	New deterministic interleaver designs for turbo codes. IEEE Trans. Inf. Theory Oscar Y. Takeshita, Daniel J. Costello Jr.
2000	—	`conf`	OPSK Space-Time Turbo Codes. ICC (1) Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita
2000	B	`conf`	Turbo codes with non-linear constituent codes. WCNC Oscar Y. Takeshita, Jing Sun, Michael P. Fitz
1999	J	`jnl`	A new technique for computing the weight spectrum of turbo-codes. IEEE Commun. Lett. Oscar Y. Takeshita, Marc P. C. Fossorier, Daniel J. Costello Jr.
1999	J	`jnl`	A note on asymmetric turbo-codes. IEEE Commun. Lett. Oscar Y. Takeshita, Oliver M. Collins, Peter C. Massey, Daniel J. Costello Jr.

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.