default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth M. Mackenthun Jr.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i5]Kenneth M. Mackenthun Jr.:
Any strongly controllable group system or group shift or any linear block code is isomorphic to a generator group. CoRR abs/2208.06953 (2022)
2010 – 2019
- 2017
- [i4]Kenneth M. Mackenthun Jr.:
The fundamental group of a strongly controllable group system, group shift, and group code. CoRR abs/1709.08265 (2017) - 2012
- [i3]Kenneth M. Mackenthun Jr.:
Some aspects of a vector basis for a controllable group system, group code, and group shift. CoRR abs/1211.2340 (2012) - 2011
- [i2]Kenneth M. Mackenthun Jr.:
Group Codes and the Schreier matrix form. CoRR abs/1106.3981 (2011)
2000 – 2009
- 2008
- [i1]Kenneth M. Mackenthun Jr.:
On strongly controllable group codes and mixing group shifts: solvable groups, translation nets, and algorithms. CoRR abs/0802.2723 (2008) - 2007
- [c2]Kenneth M. Mackenthun Jr.:
On Groups with a Shift Structure: the Schreier Matrix and an Algorithm. CISS 2007: 86-91
1990 – 1999
- 1999
- [j11]Kenneth M. Mackenthun Jr.:
Codes based on a trellis cut set transformation .II. Codes for noncoherent detection. IEEE Trans. Commun. 47(7): 998-1007 (1999) - 1998
- [j10]Kenneth M. Mackenthun Jr.:
Codes based on a trellis cut-set transformation. I. Rotationally invariant codes. IEEE Trans. Commun. 46(5): 610-620 (1998) - 1995
- [j9]Kenneth M. Mackenthun Jr.:
Covariance Matrix Properties and Multiple Symbol/Soft Decision Detection in Slow Flat Rician Fading. IEEE J. Sel. Areas Commun. 13(2): 263-275 (1995) - 1994
- [j8]Kenneth M. Mackenthun Jr.:
A fast algorithm for multiple-symbol differential detection of MPSK. IEEE Trans. Commun. 42(234): 1471-1474 (1994) - 1992
- [c1]Kenneth M. Mackenthun Jr.:
A fast algorithm for maximum likelihood detection of QPSK or pi /4-QPSK sequences with unknown phase. PIMRC 1992: 240-244
1980 – 1989
- 1982
- [j7]Kenneth M. Mackenthun Jr.:
An easily implementable universal code for the binary source. IEEE Trans. Inf. Theory 28(4): 646-648 (1982) - 1981
- [j6]Kenneth M. Mackenthun Jr.:
Noiseless coding of error detection information. IEEE Trans. Inf. Theory 27(2): 227-230 (1981) - 1980
- [j5]Kenneth M. Mackenthun Jr.:
An evaluation of the Wyner-Ziv rate region (Corresp.). IEEE Trans. Inf. Theory 26(3): 347-350 (1980)
1970 – 1979
- 1978
- [j4]Kenneth M. Mackenthun Jr., Michael B. Pursley:
Variable-rate universal block source coding subject to a fidelity constraint. IEEE Trans. Inf. Theory 24(3): 349-360 (1978) - 1977
- [b1]Kenneth M. Mackenthun Jr.:
Variable-Rate, Weakly- and Strongly-Universal Source Coding Subject to a Fidelity Constraint. University of Illinois Urbana-Champaign, USA, 1977 - [j3]Michael B. Pursley, Kenneth M. Mackenthun Jr.:
Variable-rate coding for classes of sources with generalized alphabets. IEEE Trans. Inf. Theory 23(5): 592-597 (1977) - [j2]Kenneth M. Mackenthun Jr.:
Variable-rate, weakly- and strongly-universal source coding subject to a fidelity constraint (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 23(6): 785-786 (1977) - 1976
- [j1]Kenneth M. Mackenthun Jr.:
Variable rate source coding (M.S. Thesis abstr.). IEEE Trans. Inf. Theory 22(5): 633 (1976)
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:04 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:
