default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMattias Andersson 0001
Person information
- affiliation (PhD 2014): Royal Institute of Technology, Stockholm, Sweden
Other persons with the same name
- Mattias Andersson — disambiguation page
- Mattias Andersson 0002 — Lund University, Department of Computer Science, Sweden
- Mattias Andersson 0003 — Ericsson AB, Ericsson Modems, Lund, Sweden (and 1 more)
- Mattias Andersson 0004
![[0000-0002-5383-5533]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5383-5533")
— Mid Sweden University, Sundsvall, Sweden (and 5 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[b1]Mattias Andersson:
Coding and Transmission Strategies for Secrecy. Royal Institute of Technology, Stockholm, Sweden, 2014- 2013
- [j4]Mattias Andersson, Rafael F. Schaefer, Tobias J. Oechtering, Mikael Skoglund:
Polar Coding for Bidirectional Broadcast Channels with Common and Confidential Messages. IEEE J. Sel. Areas Commun. 31(9): 1901-1908 (2013) - [j3]Vishwambhar Rathi, Mattias Andersson, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Performance Analysis and Design of Two Edge-Type LDPC Codes for the BEC Wiretap Channel. IEEE Trans. Inf. Theory 59(2): 1048-1064 (2013) - [c7]Mattias Andersson, Ashish Khisti, Mikael Skoglund:
Secure key agreement over reciprocal fading channels in the low SNR regime. SPAWC 2013: 674-678 - 2012
- [j2]Ricardo Blasco-Serrano, Ragnar Thobaben, Mattias Andersson, Vishwambhar Rathi, Mikael Skoglund:
Polar Codes for Cooperative Relaying. IEEE Trans. Commun. 60(11): 3263-3273 (2012) - [c6]Mattias Andersson, Rafael F. Wyrembelski, Tobias J. Oechtering, Mikael Skoglund:
Polar codes for bidirectional broadcast channels with common and confidential messages. ISWCS 2012: 1014-1018 - [c5]Mattias Andersson, Ashish Khisti, Mikael Skoglund:
Secret-key agreement over a non-coherent block-fading MIMO wiretap channel. ITW 2012: 153-157 - 2011
- [c4]Nicolas Schrammar, Mattias Andersson, Mikael Skoglund:
Approximate capacity of the general gaussian parallel relay network. ISIT 2011: 89-93 - [c3]Vishwambhar Rathi, Rüdiger L. Urbanke, Mattias Andersson, Mikael Skoglund:
Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel. ISIT 2011: 2393-2397 - [c2]Zhongwei Si, Mattias Andersson, Ragnar Thobaben, Mikael Skoglund:
Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ. ITW 2011: 513-517 - [c1]Mattias Andersson, Ali A. Zaidi, Niklas Wernersson, Mikael Skoglund:
Nonlinear distributed sensing for closed-loop control over Gaussian channels. Swe-CTW 2011: 19-23 - 2010
- [j1]Mattias Andersson, Vishwambhar Rathi, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Nested Polar Codes for Wiretap and Relay Channels. IEEE Commun. Lett. 14(8): 752-754 (2010) - [i3]Mattias Andersson, Vishwambhar Rathi, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Nested Polar Codes for Wiretap and Relay Channels. CoRR abs/1006.3573 (2010) - [i2]Vishwambhar Rathi, Mattias Andersson, Ragnar Thobaben, Jörg Kliewer, Mikael Skoglund:
Performance Analysis and Design of Two Edge Type LDPC Codes for the BEC Wiretap Channel. CoRR abs/1009.4610 (2010) - [i1]Vishwambhar Rathi, Rüdiger L. Urbanke, Mattias Andersson, Mikael Skoglund:
Rate-Equivocation Optimal Spatially Coupled LDPC Codes for the BEC Wiretap Channel. CoRR abs/1010.1669 (2010)
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-07-08 22:23 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:
