|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？3 p7 T1 B6 x6 [+ p7 Q; i
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity" Q$ w+ z7 ]4 M3 B( H# S
Yi Kuang;" U( s; ~2 B* X+ u' ~
Songsong Li;9 P% @! R5 w9 g# ?! R! t5 X
Shu Liu;$ l$ j9 X, U, w% P
Liming Ma;
* ^: z; R6 O* ~4 N4 e' iChaoping Xing
* E" x; m0 H3 N. Y! V0 ]3 fIEEE Transactions on Information Theory
$ r; }+ a/ Y( A9 uYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE
' l, `* g% y' h
1 H' x: y- }! j* m% o( F* m' ?Abstract2 C4 Y$ u8 ?! O+ K8 [5 ^* T
HTML
" G! N s6 t _) Q6 X; @7 [, g! `& I4 M! {% i2 r f
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN). @- Y3 p& R( A* c
Songsong Li;
$ E5 O9 P1 V$ w5 b6 ~3 R A* ]# I7 Z' QShu Liu;0 k1 Q6 U$ I. p* y& j. @
Liming Ma;- j. i( O: P3 S) P/ o! a- l
Yunqi Wan;8 e/ q' ~+ y V- W
Chaoping Xing4 t V3 \) {7 {6 X" X
IEEE Transactions on Information Theory
" Z, k* s- K+ H* @' S# LYear: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE( q _, U7 s# I V6 F8 Z
$ h2 a/ c8 S5 r% N! K' ?8 N
Abstract4 O+ }* ?+ v- e. ?6 Q
HTML; L% X1 l4 m! |% g8 d# G* n* o6 H( c
7 |6 T# p" f3 h' ]Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy
4 v( H6 K$ N6 p6 y% g$ fShu Liu;
+ ?+ T' u# A3 DIvan Tjuawinata;* e- o0 _- y& i, T" [
Chaoping Xing0 ~ J) l: p7 } W* t
IEEE Transactions on Information Theory
% l$ s& k( `( @% cYear: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE
. h) @! h4 ]1 |Cited by: Papers (4)6 x8 X% s3 V4 r) O; v
9 ]. e9 t; [4 _+ W. U$ o$ P
Abstract
: B/ v A7 V, U( W5 o7 m, HHTML h% m9 }' x( [' c; ?/ I. Y
3 C% K0 F0 E f& t( \
A Lower Bound on the List-Decodability of Insdel Codes; G5 X4 n& v. j: U- \
Shu Liu;/ I0 z$ w8 q. J4 |6 h" [! o: W
Ivan Tjuawinata;5 J% o- M; X) O# E# F1 v
Chaoping Xing
" |; e% k3 W+ h: r) ]# O" vIEEE Transactions on Information Theory( E- z& @2 \/ r& R9 ~5 P% z
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE( W8 @ G$ O9 r G' m4 h
) T6 a" H1 J& _3 ]1 Q4 xAbstract+ t% K& @# j# e4 J( w
HTML
& ]1 u$ y6 F- k: M! Z' w
1 d( N$ T( S! n) GA New Construction of Nonlinear Codes via Algebraic Function Fields: ?8 E+ T0 P i. W
Shu Liu;
0 i/ A$ D% @( T. y' }/ yLiming Ma;
1 }8 C7 L8 d" A: STing-Yi Wu;
, g3 }, f6 T- R% O$ ^# g- p" \Chaoping Xing7 t* T& n- S( @3 j* f) q
IEEE Transactions on Information Theory
6 Z G' A& Z' s0 T# pYear: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
9 d$ V1 [: l6 aCited by: Papers (1)0 @ v) }9 {; k1 w& g: K. \
% [8 P, c. u( s5 ^# KAbstract. T% z5 c. d$ j6 i F
HTML
6 {3 b. p# Q* F1 n5 C M m$ ^: l. r& N* A3 w$ I- B* g
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
; ]' n0 c# C3 ?! sShu Liu;3 C1 m6 R8 r% {7 T0 H& ^* j
Chaoping Xing
9 _( y% S0 _6 E2 aIEEE Transactions on Information Theory: U* r, B/ S8 Y1 k
Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
3 ] `% ~- e6 u4 ACited by: Papers (2)9 H' h, l5 b* P/ ^* G
# P5 |+ J- S/ Z
Abstract4 A* G, p4 W; Y4 _2 t$ k0 |& K
HTML% ~* g& M% k' B; Y
* R0 c$ A3 o2 w2 ?) kBounds and Constructions for Insertion and Deletion Codes
& K4 a0 n/ j) Y* _3 Y0 d sShu Liu;2 C! a/ `. i/ \
Chaoping Xing
; {' l5 f; w; Q# ~/ ?! [$ j+ IIEEE Transactions on Information Theory
+ C2 e- x P4 _, F& ~Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE, `5 Z# f' u5 f8 P2 ~ ]
Cited by: Papers (14)
+ i. N S0 X$ _3 a5 J9 H- g$ r9 L6 b9 j1 n$ m
Abstract; R% Q& h8 X1 u I1 B
HTML$ B3 T* C3 J- F7 {- O
9 P+ z& `/ B+ d
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation6 m0 u" T% N! [# z. C
Shu Liu;1 n: L+ `# ^$ p$ Z: @9 }
Ivan Tjuawinata;
/ v, G0 ]7 l4 S# ]( X$ E/ L& ]Chaoping Xing$ O. O: d2 I1 f! G3 M. H$ h
IEEE Transactions on Information Theory
/ |1 d4 z) ?- F9 `; VYear: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
4 T+ `8 C5 u& n$ pCited by: Papers (6)
7 r5 c% Z* }! {! M; T! s6 u
* L- s- z7 ]* I+ RAbstract% E9 q& z1 P7 P; f! r
HTML2 ?- W# e- S d# |3 e2 `
% \$ e3 ` C, u) {2 x$ DExplicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
$ X1 F- j7 M7 d1 X4 p+ d( ETai Do Duc;3 m; ]) c& o4 O' b4 Q
Shu Liu;9 E' s0 C) m4 Y( ~4 W5 S) ]0 I
Ivan Tjuawinata;- o1 E1 P K0 b5 _
Chaoping Xing
) x( a3 T& m, Q) L$ i1 J* XIEEE Transactions on Information Theory
y* c/ X8 X1 k+ WYear: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE$ A( F1 D; p* X
Cited by: Papers (17) h8 w8 E9 _% f
9 n4 C) Z* ]; h) ]+ G7 C" U, [8 v. P
Abstract
( a& a( R* t9 O, C! wHTML T. r$ z/ t o( @" ^1 S9 O$ V- S& `
6 n1 r; l$ G1 n. P* S
List Decodability of Symbol-Pair Codes
& ^2 U/ ^+ y* fShu Liu;5 l$ w: {7 P8 x) y7 @& X |; o3 S
Chaoping Xing;
4 Z2 @6 i* `$ f! D7 WChen Yuan
$ ] g% ?+ s8 ^2 F% b6 PIEEE Transactions on Information Theory; f6 X. ]7 @& n
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE
% W% U9 C9 J& FCited by: Papers (15)
H8 w \' g- t
6 j I! z) x# n, E, B% c" ZAbstract
: |( r D1 `4 P9 {9 M* HHTML& ?* d9 `- \3 s" i) ]. I/ D) n
, S+ R$ G7 R* SList Decoding of Cover Metric Codes Up to the Singleton Bound
: p+ M$ {" |; \+ |9 \! hShu Liu;
4 M, u$ ^ ^" ^! U2 gChaoping Xing;4 N# m( T2 C Z3 s
Chen Yuan( n V6 n2 k8 X5 y% y: t( \
IEEE Transactions on Information Theory
C6 A v/ K/ B4 OYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE
1 [8 |3 r! |2 y2 }# q$ j7 }Cited by: Papers (7)3 e9 g5 x' M9 o# R$ o
: r- x6 {: f# e, I3 ^- NAbstract2 D: h3 K/ h) O5 E l- h
HTML- D1 ^1 x/ f( ~+ F% s
8 H% T& I( n5 ?" z, u
List Decodability of Random Subcodes of Gabidulin Codes
! D% R" b! V4 W2 ~( ]Shu Liu;% _; n+ u2 ^7 k( R
Chaoping Xing;
1 @- L ~9 `4 l0 R: T$ aChen Yuan5 P3 j' X/ R& B% S
IEEE Transactions on Information Theory5 p2 t5 R! Z9 _6 Y' ]& m/ G( C
Year: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE. s- T- g. f2 {# L
Cited by: Papers (5)
! }! G j5 Z) x t |
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主
