|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？* H, w- q* ]1 A0 U( ?
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity
% M m9 @' \7 }- S: N; Q: V' @$ m/ \( G5 QYi Kuang;& l" r4 m9 L' _8 Q- R
Songsong Li;
" u. t \4 g5 xShu Liu;3 U; A1 L I0 T. t+ G0 |/ y
Liming Ma;& u" g' g- p, n3 U7 b
Chaoping Xing& ]2 [! k6 w5 n6 j4 w% f
IEEE Transactions on Information Theory
+ t, A) `/ \; v: dYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE1 E8 _( V H4 z4 C& }
3 V0 r' ?6 L: T8 UAbstract& I2 C" r( x& z: z
HTML
* @- s* ]2 x" A/ h- L4 U7 C+ _6 S- d' V
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)7 ?( a) f$ {# t
Songsong Li;
2 L S' v. r) o5 L) e" p0 {Shu Liu;
1 o8 s6 s) \4 z$ r3 n2 |Liming Ma;
% a# o3 i! j4 p* m+ H2 I- hYunqi Wan;
& o/ @1 T* G/ b8 d eChaoping Xing* t. i' N5 J7 i, D& y
IEEE Transactions on Information Theory% W' G9 i# I( ^+ b0 D* I, z# R
Year: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE
2 N1 w+ |$ Z" r2 H
! n/ S2 D5 {8 pAbstract5 `1 X- x7 ]% m- j
HTML) E6 l+ l* t. H7 w
j* f+ L) b3 E# i' J) v# r v
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy& v" ~: G" w$ E a& W- E b( _
Shu Liu;- M+ T; H" v7 p+ {) o7 m7 N
Ivan Tjuawinata;
: b: K0 @' i5 A6 |Chaoping Xing
" T3 D2 x9 f6 j% G8 v& O! ^IEEE Transactions on Information Theory! @" w7 d( D6 u# Q; m8 `$ }
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE
& q" W5 @" Q# p3 J: JCited by: Papers (4)+ u8 w6 o4 j1 v
, |4 z3 @7 ]4 GAbstract* L/ l! f3 ]0 \+ e, @* O1 p. b9 M
HTML
' }6 @- \2 S9 e1 H; D/ G) j8 D T# b- o5 c% G& F
A Lower Bound on the List-Decodability of Insdel Codes O" F* z8 a) P. C
Shu Liu;, Z- L7 r4 ]2 t& O! o5 W7 L1 B
Ivan Tjuawinata;5 c4 y! q% K! R/ b* `7 v Q. Q
Chaoping Xing
) o+ h0 p1 S ^; e" C" u$ A0 f, tIEEE Transactions on Information Theory) N! g' c7 Q8 N" I: F
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE
7 r, y9 @7 m' C" U+ b1 w1 O" X
Abstract
& M7 O1 ? U1 x+ v3 Z9 `$ e4 iHTML
- s) [. m/ U3 j* y. B: ^
) J X( z' e( U! p- K/ UA New Construction of Nonlinear Codes via Algebraic Function Fields
. p% D8 Y/ d) X" h$ ^" R5 GShu Liu;5 {7 h/ S ]1 @
Liming Ma;& \$ L; `. R8 v) e* u9 Y8 N
Ting-Yi Wu;6 w& ]" o6 k# W
Chaoping Xing6 g5 M2 I& b# d, D) K% N' C, ~* ?& k: ~
IEEE Transactions on Information Theory' H b6 j* a$ n5 z
Year: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE2 _' R# `6 A$ b7 s! C7 a! z7 H
Cited by: Papers (1) V. ^0 x- Z4 j3 j& F2 f8 y1 W
$ Q N- S4 Y W+ d# B& nAbstract
; {5 _! l' T6 S' y0 a7 t p2 hHTML) z" v# `. o g, z8 o. F8 ]# ]" E
" D) X6 p4 P, H2 a( @1 ZMaximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
- |( ]; E2 m, g$ gShu Liu;! T+ v# n4 K8 |! Z' h: m9 J, ^
Chaoping Xing, {0 W/ w+ Z* W- z/ v" N2 `& o
IEEE Transactions on Information Theory) {/ N+ K+ ?+ S+ h5 c# B' P/ ]
Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE9 A: Q7 ~! E. H& ^
Cited by: Papers (2)
9 @& R( s7 W) N5 ^$ t1 | ^3 q7 z" l! `( T! Y: J
Abstract
8 E. h6 _$ Z: uHTML
" f0 s: t, Q8 X' s7 t+ c% m, G! o# V3 J5 |' Q' M+ d
Bounds and Constructions for Insertion and Deletion Codes, q% e: r# a, D0 l: X
Shu Liu;! x* A. _9 |7 q( i1 R' h( m M4 p
Chaoping Xing
0 C/ x1 }5 P4 }3 D8 Z* DIEEE Transactions on Information Theory
3 c+ W; u% l6 r; BYear: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE
; A1 P+ k/ |( k% g4 CCited by: Papers (14)$ V3 @7 n& z9 _0 A. O8 C+ L9 ?' Q
7 S- E9 V" M/ gAbstract" D: Y& b! g0 ?# \5 h: K) u" o3 x: ]
HTML
4 j1 l( m5 b: l: X# f7 ?5 w3 }7 ^/ e
% a! j2 M s' r. m% ~# eEfficiently List-Decodable Insertion and Deletion Codes via Concatenation# e* E6 _. n2 W- O( L c. N4 _
Shu Liu;
9 @9 q% X" h' G/ C0 k+ FIvan Tjuawinata;
: [# z) s$ k( T% H# C% W7 {Chaoping Xing1 E* h. Q/ S; @; I
IEEE Transactions on Information Theory0 e- \( `3 u# l6 I
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
% j. J& }3 J' n/ G1 |. h: UCited by: Papers (6)+ D: m/ f- ~7 z' ]3 O' w
- ?! S. V2 [3 F3 uAbstract
. s& _, ~! W1 a- gHTML, S$ q8 H b+ B
$ l3 U7 h+ R6 ~( f, u& H1 ^
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
0 U8 Z) r) D: L; c( LTai Do Duc;' S( X% t" C4 _8 J# X
Shu Liu;6 a! Y: |6 L/ c6 ]* n4 ^! n/ s
Ivan Tjuawinata;9 Y$ Y* |5 B7 ]/ K* s
Chaoping Xing
/ R: _3 P2 @- @, {& u5 _IEEE Transactions on Information Theory
5 T; P0 z& V. {6 Z& x3 Z1 WYear: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE4 k" X' `: Q- W" ?! V
Cited by: Papers (17): m) S, P: M% a* E, W3 \
2 ?8 C! \6 u5 J. l6 j3 [' M9 u
Abstract" ^( h: n. ?6 D+ l' ^
HTML3 Y& C0 T1 Y! D* t R' ^/ |, z0 L
9 P3 E1 N+ I x/ x0 k3 n W sList Decodability of Symbol-Pair Codes" P5 |! d# g! U4 ~+ s+ o2 y$ F" h
Shu Liu;
6 Y( O; K9 m" e6 H* e1 oChaoping Xing;
3 G8 c$ a7 |" vChen Yuan
2 [) I: v7 t& bIEEE Transactions on Information Theory
& a& J1 K5 S$ n4 h5 C+ nYear: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE
' \% Y. A5 k1 M9 K+ lCited by: Papers (15)
) b. ~: d1 |3 \
9 x% R7 b8 s( l6 l; ]& M+ pAbstract0 v& ^6 `6 O7 {" o3 p2 w% _" K
HTML
/ G* I. g8 O- N5 D- l, H m+ k8 E# u
List Decoding of Cover Metric Codes Up to the Singleton Bound' V6 }+ w/ ^7 p/ a$ A8 w
Shu Liu;
~& Q" Q) m( r: D: WChaoping Xing;
' ~' U4 R% {1 g* w9 zChen Yuan
4 i5 K$ o- _9 T9 ^7 OIEEE Transactions on Information Theory5 j# y( E! ^. E4 {9 M
Year: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE- A& Q1 P8 h+ X
Cited by: Papers (7) F6 k0 {( V4 }4 V/ Z! X
) r! n- X& M: `2 O/ j- C6 k2 g/ t
Abstract6 E6 }% }! ]4 O1 ]
HTML) x. M2 V$ d. R% N( e+ m
* \' h3 b' [% e. n7 bList Decodability of Random Subcodes of Gabidulin Codes
7 b- h* o3 G! }# xShu Liu;9 c& O! d2 c, c" \( {+ `7 l
Chaoping Xing;
$ g1 B. L- }* G6 T$ X* E3 ]Chen Yuan
4 `" O0 D% |- @4 Q1 k, D% aIEEE Transactions on Information Theory
\3 K& K" q. y$ ^* CYear: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
* V/ o% w/ b+ T+ FCited by: Papers (5)
: }# \$ `# V9 F |
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主