default search action
Seokbeom Hong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j8]Hosung Park, Heeyoul Kwak, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
Variable-Weight Block Dual-Diagonal Structure for Low-Rate QC LDPC Codes With Low Error Floors. IEEE Trans. Commun. 68(3): 1344-1357 (2020)
2010 – 2019
- 2015
- [j7]Beomkyu Shin, Seokbeom Hong, Hosung Park, Jong-Seon No, Dong-Joon Shin:
New decoding scheme for LDPC codes based on simple product code structure. J. Commun. Networks 17(4): 351-361 (2015) - 2014
- [j6]Kee-Hoon Kim, Hosung Park, Seokbeom Hong, Jong-Seon No:
Fast Correlation Method for Partial Fourier and Hadamard Sensing Matrices in Matching Pursuit Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(8): 1674-1679 (2014) - [j5]Seokbeom Hong, Hosung Park, Jong-Seon No, Tor Helleseth, Young-Sik Kim:
Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping. IEEE Trans. Inf. Theory 60(6): 3698-3705 (2014) - 2013
- [j4]Sung-Tai Choi, Seokbeom Hong, Jong-Seon No, Habong Chung:
Differential spectrum of some power functions in odd prime characteristic. Finite Fields Their Appl. 21: 11-29 (2013) - [j3]Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families. IEEE Trans. Commun. 61(8): 3108-3113 (2013) - [j2]Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles. IEEE Trans. Inf. Theory 59(7): 4598-4614 (2013) - 2012
- [j1]Seokbeom Hong, Hosung Park, Beomkyu Shin, Jong-Seon No, Habong Chung:
A New Performance Measure Using k -Set Correlation for Compressed Sensing Matrices. IEEE Signal Process. Lett. 19(3): 143-146 (2012) - [c4]Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
A new parity structure with multi-weight circulants for QC LDPC codes. ISIT 2012: 3093-3097 - [i5]Beomkyu Shin, Seokbeom Hong, Hosung Park, Jong-Seon No, Dong-Joon Shin:
New decoding scheme for LDPC codes based on simple product code structure. CoRR abs/1203.4040 (2012) - [i4]Kee-Hoon Kim, Hosung Park, Seokbeom Hong, Jong-Seon No, Habong Chung:
Fast Correlation Computation Method for Matching Pursuit Algorithms in Compressed Sensing. CoRR abs/1205.4139 (2012) - [i3]Sung-Tai Choi, Seokbeom Hong, Jong-Seon No, Habong Chung:
Differential Spectrum of Some Power Functions With Low Differential Uniformity. CoRR abs/1207.1845 (2012) - [i2]Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles. CoRR abs/1210.3906 (2012) - [i1]Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families. CoRR abs/1211.3828 (2012) - 2011
- [c3]Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
Protograph design with multiple edges for regular QC LDPC codes having large girth. ISIT 2011: 918-922 - 2010
- [c2]Seokbeom Hong, Hosung Park, Beomkyu Shin, Jong-Seon No, Habong Chung:
New performance measure for compressive sensing matrices using k-set correlation. ICTC 2010: 111-112 - [c1]Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
Protograph design for QC LDPC codes with large girth. ICTC 2010: 175-176
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-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint