|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？
+ U2 Q9 h( k9 J3 W/ jEncoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity
! p4 x+ ?. ?; j$ ~& CYi Kuang;' S$ W- y! \: p( M- ~: ^
Songsong Li;
1 f ~* V: F' _1 jShu Liu;. V% [4 D' G+ i8 N
Liming Ma;5 z5 n" F* N$ s/ e; T) Z3 W0 s# k
Chaoping Xing/ h; P8 s, m- d
IEEE Transactions on Information Theory! H* s9 ^ r4 e* X5 f
Year: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE
$ ^4 e6 z, ?% a! ^' _- i. M! N. b- Y# B, @& v
Abstract. S' S8 b+ I$ F; w' t
HTML
( X1 n7 p) r3 {/ n, G J# G N7 r$ ^
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)
9 x2 r4 K9 C6 P( j7 I: wSongsong Li;
2 T: J$ K1 x8 U0 q( Q' B+ j! Z$ S! m+ c- GShu Liu;% O5 J9 F- J2 \3 W, ^
Liming Ma;
) k: |( x8 e4 IYunqi Wan;8 e/ D% ]+ m8 O. N. J7 X4 ]
Chaoping Xing9 i: G [) |# ]+ G) d1 |/ n. v+ H
IEEE Transactions on Information Theory; Y4 O3 t) H& P8 K
Year: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE5 S" F6 U; @/ Z2 ?2 i7 I( R
8 \) ?1 s" g3 Y1 Q: ~( ?
Abstract. }4 l# v0 j5 I( z7 U$ c
HTML$ V" m7 j$ U8 R d2 P' E' T
$ U' F/ `( x6 |' F1 _
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy9 ~4 Z6 |5 D4 C+ E0 O1 E' a; Q3 x
Shu Liu;
t |' F# y8 l8 B& TIvan Tjuawinata;
2 }! q( v0 `# Y! K7 PChaoping Xing3 K M. x5 z4 W+ `6 t: F5 J2 X
IEEE Transactions on Information Theory& f* S# [9 R* \% ~" M
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE5 R$ {& D$ d) C% ^% U
Cited by: Papers (4)
( T4 L3 `7 U$ \' J6 ]% h6 h- |* a& K0 \6 S- V/ i/ W: B
Abstract$ k7 p. }# I6 K7 @/ @
HTML9 E) {* K" H4 f# a* Y
, m- R Y2 I$ A& u; cA Lower Bound on the List-Decodability of Insdel Codes" n- ~7 H0 ]( b( d6 M& K- Y* Q% f
Shu Liu;
/ U* R+ a5 h/ o. FIvan Tjuawinata;
: t! l5 V: A& v( z0 w+ O7 g, Q5 a) HChaoping Xing+ r6 f3 [) x( P2 m3 L+ ^
IEEE Transactions on Information Theory( V5 L" |, S+ s" T
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE
, I# P( q7 p' s n6 W- F7 `* v. \0 w7 L" A
Abstract
' Y" m; G0 I3 p* o$ ? X9 }9 I6 iHTML! v# V1 y7 q$ I8 l
2 z% i m6 G2 K5 W% G+ U6 }, T
A New Construction of Nonlinear Codes via Algebraic Function Fields* r6 X, S; Q. Y
Shu Liu;
/ n& Z4 x# v$ {9 U6 V- HLiming Ma;
. S9 Y* I! c3 c# l- fTing-Yi Wu;- x- Q" N8 J& V1 N; Q
Chaoping Xing4 `. D3 J1 _ R, ~5 R
IEEE Transactions on Information Theory7 [5 i9 b; ?0 X- y
Year: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
- u8 m, \6 B5 v) ^Cited by: Papers (1)* C1 o1 w+ q `1 z$ Y% Y
! j, o) n* [7 ?4 G9 ~& }% m8 @; @( [
Abstract
9 C- s7 s7 y$ `* ?4 R4 ~3 _' Z; FHTML
8 K$ `5 M2 L0 K- ?4 `7 ?+ m9 T! ?% q9 }9 G. {" z! x
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems `8 D' c' C. E
Shu Liu;: Q% U: w1 |- g7 D
Chaoping Xing
% `+ m) Q9 ^2 F9 u: I( QIEEE Transactions on Information Theory
1 p+ S" X9 U5 e' [Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
M3 a! k' a+ s1 t \% {$ dCited by: Papers (2)
. ^- Q3 ~$ S7 J7 c8 A* U$ ^: Q- k9 n4 Q4 U; x& ?
Abstract+ M5 R% E4 @7 X! Z7 G8 c- U
HTML
# G4 w6 l) [5 g' K1 f6 M; h, X' v5 c! k" n
Bounds and Constructions for Insertion and Deletion Codes9 S: ?% ?* E) w/ C" D7 M$ M
Shu Liu;" [$ S6 D) i0 j# |1 E# Z4 M
Chaoping Xing
3 ~- g+ \: m0 w. ]2 H. Q; jIEEE Transactions on Information Theory5 j8 P9 H$ X& ^- V+ ~$ C
Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE
8 x; C5 a- E7 X& V; ^* WCited by: Papers (14) |" o: Q* i" x- c7 n/ x3 z+ d: O
/ h' N/ [3 d4 z* ?
Abstract3 Z7 b, d8 f0 A& E
HTML8 L8 y1 j$ U3 f' L: }$ p
. g) @7 k d7 W/ f; }, F
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation- N" l3 X6 }" [9 e7 p
Shu Liu;
! g1 ^% c% \3 I+ |- B/ b9 {/ c' GIvan Tjuawinata;/ g! H7 h3 w& Y3 X% N0 B
Chaoping Xing# F1 ~$ [0 }# J2 {0 ~" D. f5 U3 ~
IEEE Transactions on Information Theory( ]2 p K, ]: T! P8 v
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
; ^ l' u1 V; T. B0 u( T" L% y/ JCited by: Papers (6): N7 I6 H) q% ?1 j1 c# T9 J5 u
5 N4 l4 [0 \6 F
Abstract
" B8 d4 Z2 u% f. G+ T' p LHTML
/ C1 ^% i9 |6 F( q" e: H% z; j2 E" @) `2 |7 B
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
& t/ E4 Y1 M; }; v/ i; BTai Do Duc;
( g$ s* o% o7 [: j, OShu Liu;6 R) B4 m" M+ }5 `4 i
Ivan Tjuawinata;
6 X9 b, V) g8 h/ @. FChaoping Xing
0 D3 X9 u1 E ^0 W: F6 J0 |7 mIEEE Transactions on Information Theory
; L y% ^! M- o5 Q5 O+ M+ rYear: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE
$ @2 p! c- u: L% d; N- |Cited by: Papers (17)& ^ p. C- X9 u, B
9 O2 q/ I7 g8 m5 s# |+ l! \. ~
Abstract
0 |4 u7 _5 \, z5 O7 y" a) k3 @HTML
* r: e2 M- U, Z4 d0 i! [
7 ^8 L, h/ N# rList Decodability of Symbol-Pair Codes
5 s, q9 r) M s3 K4 UShu Liu;
5 m; [/ e7 M9 x6 g/ nChaoping Xing;) B4 _& p4 p7 \/ f1 |
Chen Yuan
3 o7 j. g9 _. j5 s* t# p- gIEEE Transactions on Information Theory
3 @' y: D1 `* {8 r, L( r0 l W! VYear: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE
% b& G3 Y/ I& U2 p) Q: s4 RCited by: Papers (15)
3 }: B- l/ f' q/ \' ^& P9 T
' C! {) _( t c# \- u3 Y& e; z, [4 n% O7 d" {Abstract
& |; G' W% d$ l8 D5 H$ QHTML
2 m: Z6 ~; G% r8 A# G7 ~; H( M$ G" I% C! P/ t, ]
List Decoding of Cover Metric Codes Up to the Singleton Bound
0 u. _( ~- {0 z, S# ? _ l6 rShu Liu;
7 q4 E7 K' Y7 \Chaoping Xing;7 i& y& k$ }* f$ P3 ?+ [
Chen Yuan7 q# _; ~5 z. q K8 Q- |
IEEE Transactions on Information Theory
; f3 L8 T% {6 e% Q$ fYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE' z& @' G+ t. D
Cited by: Papers (7)
) ]8 V& F# D" ?4 O% u% l% R9 d* u$ \+ O! p# K! O
Abstract
3 x( E5 @; K0 B- [/ v! PHTML; R) ]( L# c# c
. M t7 t% h9 R
List Decodability of Random Subcodes of Gabidulin Codes# n7 e0 h6 w6 N# I* |2 ]
Shu Liu;9 }! [9 `' k) ^8 [, y
Chaoping Xing;
! G. D* B1 {# P& u: R r. H( ?0 w( jChen Yuan
; s) m5 [# x' | U: W$ y. [IEEE Transactions on Information Theory
& }* M' Y/ \: [3 W3 B( x( qYear: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
! b- ?7 v/ l% `# }7 ^Cited by: Papers (5)
8 Z! k5 w+ ^: v5 ~ |
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主