default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOscar Y. Takeshita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c10]Scott Enserink, Michael P. Fitz, Changyi Gu, Thomas R. Halford, Iftekhar Hossain, Sungill Kim, Oscar Y. Takeshita:
Joint Analog and Digital Interference Cancellation. DySPAN 2014: 378-379- 2013
- [p1]Oscar Y. Takeshita:
Turbo codes over finite fields. Handbook of Finite Fields 2013: 727-734 - 2011
- [j17]Pengkai Zhao, Babak Daneshrad, Ajit Warrier, Weijun Zhu, Oscar Y. Takeshita:
Performance of a Concurrent Link SDMA MAC Under Practical PHY Operating Conditions. IEEE Trans. Veh. Technol. 60(3): 1301-1307 (2011) - [i5]Jonghoon Ryu, Oscar Y. Takeshita:
On Inverses for Quadratic Permutation Polynomials over Integer Rings. CoRR abs/1102.2223 (2011) - 2010
- [c9]Omar A. Nasr, Oscar Y. Takeshita, Weijun Zhu, Babak Daneshrad:
Field Trial Results of a 4X4 MIMO-OFDM Real Time Testbed. ICC 2010: 1-5
2000 – 2009
- 2007
- [j16]Oscar Y. Takeshita:
Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective. IEEE Trans. Inf. Theory 53(6): 2116-2132 (2007) - 2006
- [j15]Yen-Lun Chen, Jonghoon Ryu, Oscar Y. Takeshita:
A simple coefficient test for cubic permutation polynomials over integer rings. IEEE Commun. Lett. 10(7): 549-551 (2006) - [j14]Oscar Y. Takeshita:
On maximum contention-free interleavers and permutation polynomials over integer rings. IEEE Trans. Inf. Theory 52(3): 1249-1253 (2006) - [j13]Jonghoon Ryu, Oscar Y. Takeshita:
On quadratic inverses for quadratic permutation polynomials over integer rings. IEEE Trans. Inf. Theory 52(3): 1254-1260 (2006) - [c8]Oscar Y. Takeshita:
A Compact Construction for LDPC Codes using Permutation Polynomials. ISIT 2006: 79-82 - [c7]Oscar Y. Takeshita:
A New Metric for Permutation Polynomial Interleavers. ISIT 2006: 1983-1987 - [c6]Eirik Rosnes, Oscar Y. Takeshita:
Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes. ISIT 2006: 1988-1992 - [c5]Hyun Seo Oh, Jonghoon Ryu, Oscar Y. Takeshita:
Rapid Dual Channel Frequency and Frame Synchronizer for OFDM Packet Transmission. MobiQuitous 2006: 1-6 - [i4]Oscar Y. Takeshita:
Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective. CoRR abs/cs/0601048 (2006) - 2005
- [j12]Jing Sun, Oscar Y. Takeshita:
Extended tail-biting schemes for turbo codes. IEEE Commun. Lett. 9(3): 252-254 (2005) - [j11]Aditi Kothiyal, Oscar Y. Takeshita, Wenyi Jin, Marc P. C. Fossorier:
Iterative reliability-based decoding of linear block codes with adaptive belief propagation. IEEE Commun. Lett. 9(12): 1067-1069 (2005) - [j10]Jing Sun, Oscar Y. Takeshita:
On maximum-length linear congruential-sequences-based low-density parity-check codes. IEEE Trans. Commun. 53(12): 1977-1980 (2005) - [j9]Jing Sun, Oscar Y. Takeshita:
Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Trans. Inf. Theory 51(1): 101-119 (2005) - [c4]Aditi Kothiyal, Oscar Y. Takeshita:
A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes. ISIT 2005: 724-728 - [i3]Oscar Y. Takeshita:
A New Construction for LDPC Codes using Permutation Polynomials over Integer Rings. CoRR abs/cs/0506091 (2005) - [i2]Oscar Y. Takeshita:
On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings. CoRR abs/cs/0506093 (2005) - [i1]Jonghoon Ryu, Oscar Y. Takeshita:
On Quadratic Inverses for Quadratic Permutation Polynomials over Integer Rings. CoRR abs/cs/0511060 (2005) - 2004
- [j8]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:
Multi-antenna testbeds for research and education in wireless communications. IEEE Commun. Mag. 42(12): 72-81 (2004) - 2003
- [j7]Hesham El Gamal, A. Roger Hammons Jr., Youjian Liu
, Michael P. Fitz, Oscar Y. Takeshita:
On the design of space-time and space-frequency codes for MIMO frequency-selective fading channels. IEEE Trans. Inf. Theory 49(9): 2277-2292 (2003) - 2002
- [j6]Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita:
A rank criterion for QAM space-time codes. IEEE Trans. Inf. Theory 48(12): 3062-3079 (2002) - 2001
- [j5]Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita:
Full rate space-time turbo codes. IEEE J. Sel. Areas Commun. 19(5): 969-980 (2001) - [j4]Oscar Y. Takeshita, Oliver M. Collins, Peter C. Massey, Daniel J. Costello Jr.:
On the frame-error rate of concatenated turbo codes. IEEE Trans. Commun. 49(4): 602-608 (2001) - [c3]Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita:
Space-time codes performance criteria and design for frequency selective fading channels. ICC 2001: 2800-2804 - 2000
- [j3]Oscar Y. Takeshita, Daniel J. Costello Jr.:
New deterministic interleaver designs for turbo codes. IEEE Trans. Inf. Theory 46(6): 1988-2006 (2000) - [c2]Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita:
OPSK Space-Time Turbo Codes. ICC (1) 2000: 292-296 - [c1]Oscar Y. Takeshita, Jing Sun, Michael P. Fitz:
Turbo codes with non-linear constituent codes. WCNC 2000: 144-146
1990 – 1999
- 1999
- [j2]Oscar Y. Takeshita, Oliver M. Collins, Peter C. Massey, Daniel J. Costello Jr.:
A note on asymmetric turbo-codes. IEEE Commun. Lett. 3(3): 69-71 (1999) - [j1]Oscar Y. Takeshita, Marc P. C. Fossorier, Daniel J. Costello Jr.:
A new technique for computing the weight spectrum of turbo-codes. IEEE Commun. Lett. 3(8): 251-253 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
